제출 #144283

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

segments

#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()

#define boost ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;

const ll INF=1e18;
const ll inf=1e9;
const ld eps=1e-7;
const ld pi=acos(-1);
const int dx[4]={0,0 ,1,-1};
const int dy[4]={1,-1,0,0};
const int N=5e5+11;
const int M=1e3+11;
const int mod1=998244353;
const int mod2=1e9+7;

ll dp[N],sum[N],a[N],p[N];

int main(){
  int n;
  cin>>n;
  for(int i=1;i<=n;i++){
    cin>>a[i];
    p[i]=p[i-1]+a[i];
  }
  dp[0]=0;
  sum[0]=0;
  for(int i=1;i<=n;i++){
    int k=0;
    for(int j=1;j<i;j++){
      if(sum[j]+p[j]<=p[i]){
        if(dp[k]<=dp[j])k=j;
      }
    }
    dp[i]=dp[k]+1;
    sum[i]=p[i]-p[k];
  }
  cout<<dp[n];
}

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