Submission #2786383

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 10;
int n, m, ans, sum, a[N], jmp[N];

template <class T> inline void in(T &x) {
	x = 0; int f = 1; char ch = getchar();
	for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();}
	for (; ch>='0' && ch<='9';) x = x*10 + ch-'0', ch = getchar();
	x *= f;
}

int main() {
	int x; in(n);
	for (int i = 1; i < n; ++i) in(a[i]);
	for (int i = 1; i < n; ++i) {
		for (int j = sum + 1; j <= sum + a[i]; ++j)
			jmp[j] = (i > 2) ? (2 * sum - j) : j;
		sum += a[i];
	}
	for (int i = 0; i <= sum; ++i)
		if (jmp[i] > 0) jmp[i] = jmp[jmp[i]];
	for (in(m); m --;) {
		in(x);
		ans = sum - x;
		if (ans > 0) ans = jmp[ans];
		printf("%d\n", 2 * a[1] - ans);
	}
	return 0;
}

Submission Info

Judge Result