Straight Master Gym - 101775J

https://cn.vjudge.net/problem/Gym-101775J

构造差分数组，345可以组成任意大于3的数，所以b[i]大于0必然可以打出顺子；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2e5+2;
const int mod=1e9+7;

int a[maxn],b[maxn];

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;

    int cas=0;

    //cin>>T;
    sfi(T);
    while(T--)
    {
        int n;
        //cin>>n>>m;

        sfi(n);

        for(int i=1;i<=n;i++) sfi(a[i]);
        a[n+1]=0;
        for(int i=1;i<=n+1;i++) b[i]=a[i]-a[i-1];

        bool ans=1;
        int now=0;
        for(int i=1;i<=n+1;i++)
        {
            while(now<=i-3&&b[i]<0)
            {

                if(b[now]+b[i]>=0)
                {
                    b[now]+=b[i];
                    b[i]=0;
                }
                else
                {
                    b[i]+=b[now];
                    b[now]=0;
                }
                if(b[i]<0) now++;
            }
            if(b[i]<0)
            {
                ans=0;
                break;
            }
        }

        printf("Case #%d: %s\n",++cas,ans?"Yes":"No");

    }



    return 0;
}