# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067096 | manhlinh1501 | Bigger segments (IZhO19_segments) | C++17 | 85 ms | 46416 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;
using i64 = long long;
const int MAXN = 5e5 + 5;
using pli = pair<i64, int>;
using pii = pair<int, int>;
const i64 oo64 = 5e15 + 5;
int N;
int a[MAXN];
i64 b[MAXN];
pli dp[MAXN];
vector<int> g[MAXN];
signed main() {
#define TASK "code"
if (fopen(TASK ".inp", "r")) {
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
for(int i = 1; i <= N; i++) cin >> a[i];
for(int i = 1; i <= N; i++) b[i] = b[i - 1] + a[i];
pii cur = {0, 0};
for(int i = 1; i <= N; i++) {
for(int j : g[i]) {
if(dp[j].second > cur.second or (dp[j].second == cur.second and j > cur.first))
cur = {j, dp[j].second};
}
dp[i] = {b[i] - b[cur.first], cur.second + 1};
int p = lower_bound(b + 1, b + N + 1, dp[i].first + b[i]) - b;
g[p].emplace_back(i);
}
cout << dp[N].second;
}
/**
4
2 3 1 7
**/
/**
5
6 2 3 9 13
**/
/**
3
3 1 2
**/
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... |