Submission #1066136

#TimeUsernameProblemLanguageResultExecution timeMemory
1066136aufanBigger segments (IZhO19_segments)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n;
        cin >> n;

        vector<int> a(n + 1);
        for (int i = 1; i <= n; i++) cin >> a[i];
        
        vector<int> p(n + 1);
        for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i];

        int ans = 1;
        for (int i = 2, j = 1, k = 0; i <= n; i++) {
                if (p[i] - p[j] >= p[j] - p[k]) {
                        while (j + 1 <= i && p[i] - p[j + 1] >= p[j + 1] - p[k]) {
                                j += 1;
                        }
                        k = j;
                        j = i;

                        ans += 1;
                }
        }

        cout << ans << '\n';
        
        return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...