# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376317 | jamielim | Bigger segments (IZhO19_segments) | C++14 | 110 ms | 492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
typedef pair<ll,ll> pll;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;
int n;
ll arr[500005];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%lld",&arr[i]);
int ans=0;
for(int i=0;i<(1<<(n-1));i++){
int bm=i;
vector<int> v;
while(bm&(-bm)){
int x=__builtin_ctz(bm);
v.pb(x);
bm-=(bm&(-bm));
}
v.pb(n-1);
int cur=0;ll sum=0,prv=0;
bool poss=1;
for(int j:v){
while(cur<=j){
sum+=arr[cur];
cur++;
}
if(sum<prv){
poss=0;break;
}else{
prv=sum;sum=0;
}
}
if(poss)ans=max(ans,SZ(v));
}
printf("%d",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |