# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290744 | Autoratch | Bigger segments (IZhO19_segments) | C++14 | 1589 ms | 3636 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;
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));
int id = 0;
for(auto [x,y] : res) if(x<=s[i]) id = max(id,y);
dp[i] = dp[id]+1;
mn[i] = s[i]-s[id];
/*
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];
}
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... |