Submission #952936

#TimeUsernameProblemLanguageResultExecution timeMemory
952936ezzzayBigger segments (IZhO19_segments)C++14
13 / 100
614 ms444 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ff frist #define ss second #define pb push_back= const int N=2e5+5; int a[N]; signed main(){ int ans=0; int n; cin>>n; for(int i=0;i<n;i++)cin>>a[i]; for(int i=0;i<(1<<n);i++){ int s=0; int tmp=0; int u=1; int cnt=0; for(int j=0;j<n;j++){ s+=a[j]; if(i & (1<<j)){ if(tmp>s){ u=0; } tmp=s; s=0; cnt++; } } if(u){ ans=max(ans,cnt); } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...