题解:SP16248 NCLNE - Clones
SP16248 NCLNE - Clones
解题思路
用 No。
完整代码
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
const int MAXN=1e6+7;
long long T,n,a[MAXN],sum;
bool law=1;
int main()
{
scanf("%lld",&T);
while(T--)
{
law=sum=1;
scanf("%lld",&n);
for(int i=1;i<=n;i++){
scanf("%lld",a+i);
if((sum-=a[i])<0)law=0;
sum<<=1;
}
if(sum)law=0;
if(law)puts("Yes");
else puts("No");
}
return 0;
}