# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299741 | dantoh000 | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 384 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 fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll, int> li;
ii dp[500005];
int n;
ll p[500005];
priority_queue<li ,vector<li>, greater<li> > pq;
int main(){
scanf("%d",&n);
pq.push({0,0});
for (int i = 1; i <= n; i++){
scanf("%lld",&p[i]);
p[i]+=p[i-1];
li cur;
while (pq.size() && pq.top().first <= p[i]) {
cur = pq.top(); pq.pop();
}
pq.push(cur);
//printf("%d: can get %d %d (%d,%d)\n",p[i],pq.top().fi, pq.top().se, dp[pq.top().se].fi, dp[pq.top().se].se);
dp[i].fi = dp[pq.top().se].fi + 1;
dp[i].se = pq.top().se;
//printf("pushing (%d,%d)\n",2*p[i]-p[dp[i].se], i);
pq.push({2*p[i]-p[dp[i].se], i});
}
printf("%d",dp[n].fi);
}
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... |