TopCoder Single Round Match 762 SRM 762 - Division I, Level One 思维

 

 

#include <bits/stdc++.h>
#define en '\n'
#define ll long long
const int inf=0x3f3f3f3f;
using namespace std;
const int maxn =2e5+10;
#define pb push_back
int rd(){int tt;scanf("%d",&tt);return tt;}
ll sm[maxn];
#define pb push_back
class 	LexicographicPartition{
    public:
        vector<int> positiveSum(int n, vector<int> Aprefix, int seed, int Arange){
                int state=seed;
                for(int i=Aprefix.size();i<n;i++){
                    ll tem= ((ll)1103515245 * state + 12345);
                    Aprefix.pb(tem % (2*Arange+1)) ;
                    Aprefix[i] = Aprefix[i] - Arange;
                    state = tem % (1ll<<31);
                }
                sm[0]=Aprefix[0];
                for(int i=1;i<n;i++){
                    sm[i]=sm[i-1]+Aprefix[i];
                }
                vector<int>ans;
                if(sm[n-1]<=0){ans.pb(-1);return ans;}
                for(int i=0;i<n;){
                  int j;
                  for(j=i;j<n;j++){
                    if(sm[n-1]-sm[j]>0 and sm[j]-((i==0)?0:sm[i-1] ) >0)break;
                  }
                  j=min(j,n-1);
                  ans.pb(j-i+1);
                    i=j+1;
                }
                vector<int>Ans;Ans.pb(ans.size());
                for(int i=0;i<ans.size() and i<200;i++){
                    Ans.pb(ans[i]);
                }
        return Ans;
    	}
};
#ifdef swt
signed main(){
    freopen("input2.txt","r",stdin);
}
#endif // swt