# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
176033 | mcdx9524 | Bigger segments (IZhO19_segments) | C++14 | 122 ms | 14224 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;
typedef long long ll;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l, int r) {
return uniform_int_distribution <int> (l, r) (rnd);
}
const int inf = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector <int> a(n + 1, 0);
vector <ll> pref(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = a[i] + pref[i - 1];
}
vector <pair <int, ll> > dp(n + 1, {0, inf});
dp[0] = {0, 0};
for (int i = 0; i <= n; i++) {
if (i >= 1) {
ll sum = a[i];
if (dp[i - 1].first > dp[i].first) {
dp[i].first = dp[i - 1].first;
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... |