Submission #290731

#TimeUsernameProblemLanguageResultExecution timeMemory
290731AutoratchBigger segments (IZhO19_segments)C++14
0 / 100
1 ms512 KiB
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 1; long long n,s[N],dp[N],mn[N]; vector<pair<long long,int> > res; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 1;i <= n;i++) cin >> s[i],s[i]+=s[i-1]; for(int i = 1;i <= n;i++) { auto it = upper_bound(res.begin(),res.end(),make_pair(s[i],INT_MAX)); if(it==res.begin()) { dp[i] = 1; mn[i] = s[i]; } else { it--; int x = it->second; dp[i] = dp[x]+1; mn[i] = s[i]-s[x]; } res.push_back({mn[i]+s[i],i}); } cout << dp[n]; }
#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...