Submission #1455720

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

inline int read(){
	char ch = getchar(); int x = 0;
	while (ch < '0' || '9' < ch) ch = getchar();
	while ('0' <= ch && ch <= '9') { x = x*10 + ch-'0'; ch = getchar(); }
	return x;
}
const int maxn = 500009;
int d[maxn], pre[maxn], suf[maxn];
int n, Q, q;

int main(){
	n = read(); pre[0] = read();
	for (int i=1; i<=n; i++) d[i] = read();
	for (int i=1; i<=n; i++)
		if (abs(pre[i-1]-d[i]) < pre[i-1]) pre[i] = abs(pre[i-1]-d[i]);
		else pre[i] = pre[i-1];
	suf[n+1] = 1;
	for (int i=n; i>=1; i--)
		if (d[i] >= 2*suf[i+1]) suf[i] = suf[i+1];
		else suf[i] = suf[i+1] + d[i];
	Q = read();
	while (Q--){
		q = read();
		puts(pre[q-1] >= suf[q+1] ? "YES" : "NO");
	}
	return 0; 
}

Submission Info

Judge Result