Submission #994204

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>

#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <deque>
#include <string>

#include <algorithm>
#include <numeric>

#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>

#define pb push_back
#define pbk pop_back
#define mp make_pair
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define foreach(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); ++i)
#define len(a) ((int) (a).size())

#ifdef CUTEBMAING
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

using namespace std;

typedef long long int64;
typedef long double ld;
typedef unsigned long long lint;

const int inf = (1 << 30) - 1;
const int64 linf = (1ll << 62) - 1;
const int N = 1e6 + 100;

int n, m;
int a[N];

int64 sum[N];

int64 dp[N];
int64 rmq[N * 4 + 100];

int wh[N];

void make_rmq(int i, int l, int r) {
    rmq[i] = -linf;
    if (l == r) {
        return void (wh[l] = i);
    }
    make_rmq(i * 2, l, (l + r) / 2);
    make_rmq(i * 2 + 1, (l + r) / 2 + 1, r);
}

inline int64 getValue(int i, int ll, int rr, int l, int r) {
    if (ll > r || rr < l) {
        return -linf;
    }
    if (l <= ll && rr <= r) {
        return rmq[i];
    }
    return max(getValue(i * 2, ll, (ll + rr) / 2, l, r), getValue(i * 2 + 1, (ll + rr) / 2 + 1, rr, l, r));
}

inline void update(int, int, int, int i, int value) {
    i = wh[i];
    rmq[i] = value;
    for (i >>= 1; i; i >>= 1) {
        rmq[i] = max(rmq[i * 2], rmq[i * 2 + 1]);
    }
}

int main() {
#ifdef XCODE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        scanf("%d", &a[i]);
    }
    cin >> m;
    assert(m == 1);
        for (int i = 0; i < m; i++) {
        cin >> a[n - 1];
        dp[n] = 0;
        make_rmq(1, 0, n - 1);
        sum[0] = a[0];
        for (int i = 1; i < n; i++) {
            sum[i] = sum[i - 1] + a[i];
        }
        update(1, 0, n - 1, n - 1, a[n - 1] - sum[n - 2] - dp[n - 1]);
        for (int i = n - 2; i >= 1; i--) {
            dp[i] = getValue(1, 0, n - 1, i + 1, n - 1) + sum[i];
            update(1, 0, n - 1, i, a[i] - sum[i - 1] - dp[i]);
        }
        cout << dp[1] + a[0] - a[1] << endl;
    }
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:91:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

Judge Result