Submission #5149168

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"

using namespace std;

//const long long int MOD = 1000000007;
const int MOD = 1000000007;
//const int MOD = 998244353;

long long int N, M, K, H, W, L, R;
//int N, M, K, H, W, L, R;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	vector<int>v(N - 1);
	for (auto& i : v)cin >> i;
	cin >> M;
	int sum = accumulate(v.begin(), v.end(), 0);
	sum -= v[0] + v[1];
	deque<int>Q;
	for (int i = 0; i <= sum; i++)Q.push_back(i);
	for (int i = 2; i < N - 1; i++) {
		vector<int>p;
		for (int j = 1; j <= v[i]; j++) {
			p.push_back(Q[j]);
		}
		for (int j = 1; j <= v[i]; j++)Q.pop_back();
		for (auto j : p)Q.push_front(j);
	}
	for (int i = 0; i < M; i++) {
		cin >> K;
		if (K > sum) {
			cout << K - sum + v[0] - v[1] << endl;
		}
		else {
			cout << Q[K] + v[0] - v[1] << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result