# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257626 | BThero | Bigger segments (IZhO19_segments) | C++17 | 1592 ms | 3456 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.
// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = (int)5e5 + 5;
const ll INF = (ll)1e16;
pair<int, ll> dp[MAXN];
ll pref[MAXN];
int arr[MAXN];
int n;
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &arr[i]);
pref[i] = pref[i - 1] + arr[i];
}
for (int i = 1; i <= n; ++i) {
dp[i] = mp(0, INF);
}
dp[0] = mp(0, 0);
for (int i = 1; i <= n; ++i) {
int j = i - 1;
while (dp[j].se + pref[j] > pref[i]) {
--j;
}
dp[i].fi = dp[j].fi + 1;
dp[i].se = pref[i] - pref[j];
//T.pb(mp(dp[i].se + pref[i], i));
}
printf("%d\n", dp[n].fi);
}
int main() {
int tt = 1;
while (tt--) {
solve();
}
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... |