제출 #1266102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266102		rayan_bd	Bigger segments (IZhO19_segments)	C++20	37 / 100	1593 ms	2336 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 5e5 + 100;
int a[mxN];
pair<int, int> dp[mxN];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

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

    for(int i = 1; i <= n; ++i){
        for(int j = i, s = 0; j >= 1; --j){
            s += a[j];
            if(dp[j - 1].second <= s){
                if(dp[i].first == dp[j - 1].first + 1){
                    dp[i] = min(dp[i], {dp[j - 1].first + 1, s});
                }
                else dp[i] = max(dp[i], {dp[j - 1].first + 1, s});
            }
        }
    }
    cout << dp[n].first << "\n";

    return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27