제출 #345123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345123		Rakhmand	Bigger segments (IZhO19_segments)	C++14	13 / 100	2 ms	364 KiB

segments

//
//  A.cpp
//  torelax
//
//  Created by Rakhman on 1/5/21.
//

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>

#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define no_answer {cout << "NO"; exit(0);}
#define FOR(i, start, finish, k) for(llong i = start; i <= finish; i += k)

const long long mxn = 1e6 + 110;
const long long mnn = 3e3 + 2;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
const long long OO = 1e9 + 100;

typedef long long llong;
typedef unsigned long long ullong;

using namespace std;

int n, b[mxn], pr[mxn], mx[mxn], dp[mxn];

int main() {
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> b[i];
        pr[i] = pr[i - 1] + b[i];
    }
    for(int i = 1; i <= n; i++){
        for(int k = i - 1; k >= 0; k--) {
            if(pr[i] - pr[k] >= mx[k]) {
                dp[i] = dp[k] + 1;
                mx[i] = pr[i] - pr[k];
                break;
            }
        }
    }
    cout << dp[n];
}

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