# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497426 | Nalrimet | Bigger segments (IZhO19_segments) | C++17 | 1557 ms | 12068 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>
#pragma GCC optimization("g", on)
#pragma GCC optimize ("inline")
#pragma GCC optimization("03")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#define ll long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 5 * 1e5 + 5;
const int inf = 1e9 + 7;
long long a[N], pref[N], dp[N], mn[N], sum[N];
vector<int> v[N];
int n, cur, ans;
void rec(int pos){
if(pos > n){
ans = max(ans, cur);
return;
}
sum[cur] += a[pos];
rec(pos + 1);
if(sum[cur] >= sum[cur - 1]){
cur++;
rec(pos + 1);
cur--;
}
sum[cur] -= a[pos];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> a[i];
}
rec(1);
cout << ans;
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... |