# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952683 | dilanyan | Bigger segments (IZhO19_segments) | C++17 | 56 ms | 20972 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.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------Kargpefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
void KarginSet(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(NULL);
if (name.size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
//-------------------KarginConstants------------------\\
const ll mod = 1000000007;
const ll inf = 1e15;
//-------------------KarginCode-----------------------\\
const int N = 500005, M = 1000005;
ll a[N], pref[N];
ll dp[N], p[N];
void KarginSolve() {
int n; cin >> n;
for (int i = 1;i <= n;i++) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
dp[0] = 0;
for (int i = 1;i <= n;i++) {
p[i] = max(p[i], p[i - 1]);
dp[i] = dp[p[i]] + 1;
ll sum = pref[i] - pref[p[i]];
int j = lower(pref + i, pref + n + 1, pref[i] + sum) - pref;
p[j] = i;
}
cout << dp[n] << '\n';
}
int main() {
KarginSet();
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
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... |