제출 #344746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344746		tata666	Bigger segments (IZhO19_segments)	C++17	37 / 100	1588 ms	2668 KiB

segments

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define sz(x) (int)x.size()
#define sbb (x & (-x))
#define all(x) begin(x), end(x)

using namespace std;

typedef long long llong;
typedef pair <llong, int> pii;

const int MXN = 4e5 + 7;
const int MOD = 1e9 + 7;
const llong INF = 1e18 + 7;
const int N = 2e5;

int n, a[MXN], dp[MXN];
llong pref[MXN], mx[MXN];

int main(){
  ios_base::sync_with_stdio(0);
  cin >> n;
  for(int i = 1; i <= n; i++){
    cin >> a[i];
    pref[i] = pref[i - 1] + a[i];
  }
  dp[1] = 1;
  for(int i = 1; i <= n; i++){
    int k = i;
    for(; k >= 1; k--){
      if(pref[i] - pref[k - 1] >= mx[k - 1]) break;
    }
    dp[i] = dp[k - 1] + 1;
    mx[i] = pref[i] - pref[k - 1];
  }
  cout << dp[n];
  return 0;
}

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