# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
180305 | rzbt | Bigger segments (IZhO19_segments) | C++14 | 2 ms | 376 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>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 500005
typedef long long ll;
using namespace std;
ll n;
ll mz=0;
ll tz=0;
ll res=0;
ll niz[MAXN];
pair<ll,ll> dp[MAXN];
ll pref[MAXN];
ll bin(ll l,ll d,ll sol,ll tren){
if(l>d)return sol;
ll mid=(l+d)/2;
if(pref[tren]-pref[mid]>=dp[mid].F)return bin(mid+1,d,mid,tren);
return bin(l,mid-1,sol,tren);
}
int main()
{
scanf("%lld", &n);
for(ll i=1;i<=n;i++){
scanf("%lld",niz+i);
pref[i]=pref[i-1]+niz[i];
}
//dp[i]=mp(pref[i],1);
for(ll i=1;i<=n;i++){
ll koji=bin(1,i-1,0,i);
//printf(" %lld %lld %lld %lld",i,koji)
dp[i]=mp(pref[i]-pref[koji],dp[koji].S+1);
}
printf("%lld",dp[n].S);
return 0;
}
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... |