Submission #1438455

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define INF 2147483647
#define MOD 1000000007
#define EPS 1e-10
//#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplece_back
#define mp make_pair
#define i_i pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< i_i >
#define Edge pair< i_i, int>
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; scanf("%d", &x);
#define int2(x, y) int x, y; scanf("%lld %lld", &x, &y);
#define fir first
#define sec second
#define ffir first.first
#define fsec first.second
#define sfir second.first
#define ssec second.second
 
//int dxy[5] = {0, 1, 0, -1, 0};
// assign

class segtree
{
    private:
        int dfs(int a,int b,int k,int l,int r)
        {
            //* 要求範囲を含まないレンジの探索.
            if (r <= a || b <= l) {
                return INF;
            }
            //* 木のレンジが要求範囲以下になる時.
            if (a <= l && r <= b) {
                return tree[k];
            }
            int m = (l+r)/2;
            return min(dfs(a, b, k*2+1, l, m), dfs(a, b, k*2+2, m, r));
        }
    public:
        int size;
        vi tree;

        segtree(int _size, int _firstnum){
            size = 1;
            while (size < _size) size *= 2;
            size <<= 1;
            tree = vi(size, 0);
            if (_firstnum) {
                rep(i, tree.size()) tree[i] = _firstnum;
            }
        }
        segtree(int _size){
            size = 1;
            while (size < _size) size *= 2;
            size <<= 1;
            tree = vi(size, 0);
        }
        int getMin(int left, int right)
        {
            return dfs(left, right, 0, 0, size/2);
        }
        void update(int pos, int value)
        {
            pos += (size/2 -1);
            tree[pos] = value;
            while (pos) {
                pos = (pos-1)/2;
                tree[pos] = min(tree[pos*2+1], tree[pos*2+2]);
            }
        }
        int get_allmin()
        {
            return tree[0];
        }
};

vi data, gyaku;
segtree seg(0);

long long solve(int l, int r)
{
    //cout << "(" << l << "," << r << ")" << endl;
    if (l + 1 == r) {
//        cout << "ret" << data[l] << endl;
        return data[l];
    } else if (l >= r) {
 //       cout << "ret0" << endl;
        return 0;
    }
    int targ = seg.getMin(l, r);
    int targpos = gyaku[targ];
 //   cout << targ << " " << targpos << endl;
    long long ret = ((targpos - l + 1) * (r - targpos)) * targ;
//    cout << "ret" << ret << endl;
    return solve(l, targpos) + ret + solve(targpos+1, r);
}


signed main()
{
    Int(n);
    data = vi(n);
    gyaku = vi(n);
    seg = segtree(n);
    rep(i, n) {
        cin >> data[i];
        gyaku[data[i]] = i;
        seg.update(i, data[i]);
    }

    cout << solve(0, n) << endl;

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 #define Int(x) int x; scanf("%d", &x);
                                      ^
./Main.cpp:113:5: note: in expansion of macro ‘Int’
     Int(n);
     ^

Judge Result