제출 #1266287

#제출 시각아이디문제언어결과실행 시간메모리
1266287kawhietBigger segments (IZhO19_segments)C++20
37 / 100
1593 ms3140 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++ ) {
    	cin >> a[i];
    }
    vector<int64_t> p(n + 1);
    for (int i = 1; i <= n; i++) {
    	p[i] = p[i - 1] + a[i];
    }
    vector<array<int64_t, 2>> dp(n + 1);
    dp[0] = {0, -LLONG_MAX};
    for (int i = 1; i <= n; i++) {
    	for (int j = 0; j < i; j++) {
    		int64_t sum = p[i] - p[j];
    		if (sum >= dp[j][1]) {
    			if (dp[j][0] + 1 > dp[i][0]) {
    				dp[i][0] = dp[j][0] + 1;
    				dp[i][1] = sum;
    			} else if (dp[j][0] + 1 == dp[i][0]) {
    				dp[i][1] = min(dp[i][1], sum);
    			}
    		}
    	}
    }
    cout << dp[n][0] << '\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...