Submission #5398724

---

Source Code Expand

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
	if(c == '-') f = -1;
	c = getchar();
    }
    while(c >= '0' && c <= '9') {
	res = res * 10 +c - '0';
	c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
	out(x / 10);
    }
    putchar('0' + x % 10);
} 
int N,M;
int A[MAXN],s;
deque<int> dp;
vector<int> v;
void Solve() {
    read(N);
    for(int i = 1 ; i < N ; ++i) {
	read(A[i]);
	if(i >= 3) s += A[i];
    }
    for(int i = 0 ; i <= s ; ++i) dp.push_back(i);
    for(int i = 3 ; i < N ; ++i) {
	v.clear();
	for(int j = 1 ; j <= A[i] ; ++j) v.pb(dp[j]);
	for(auto t : v) dp.push_front(t);
	for(int j = 1 ; j <= A[i] ; ++j) dp.pop_back();
    }
    int x;
    read(M);
    for(int i = 1 ; i <= M ; ++i) {
	read(x);
	if(x >= s) {out(x - s + A[1] - A[2]);enter;}
	else {out(dp[x] + A[1] - A[2]);enter;}
    }
}
int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

Submission Info

Judge Result