Submission #344536

#TimeUsernameProblemLanguageResultExecution timeMemory
344536koketsuBigger segments (IZhO19_segments)C++14
37 / 100
1566 ms3380 KiB
#include <bits/stdc++.h>
#define pb push_back
#define LL long long
#define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const LL Mxn = 1e6 + 7;
const LL Mod = 1e9 + 7;
const LL Inf = 1e14 + 7;

LL N, A[Mxn], Mx[Mxn], Dp[Mxn], Pref[Mxn];

int main() {
    Kultivator;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> A[i];
        Pref[i] = (Pref[i - 1] + A[i]);
    }
    for(int i = 1; i <= N; i++){
        int K = i;
        for(; K >= 1; K--){
            if(Pref[i] - Pref[K - 1] >= Mx[K - 1]) break;
        }
        Mx[i] = (Pref[i] - Pref[K - 1]);
        Dp[i] = Dp[K - 1] + 1;
    }
    cout << Dp[N];
}
#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...