제출 #1039007

#제출 시각아이디문제언어결과실행 시간메모리
1039007vjudge1Bigger segments (IZhO19_segments)C++17
37 / 100
1577 ms2988 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define int long long signed main(){ ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<ll> a(n); for(int i=0;i<n;i++){ cin >> a[i]; } vector<int> dp(n),sum(n); dp[0] = 1; sum[0] = a[0]; for(int i=1;i<n;i++){ dp[i] = dp[i-1]; sum[i] = a[i]; for(int j=i-1;j>=0;j--){ if(sum[i] >= sum[j]){ dp[i] = dp[j]+1; break; } sum[i] += a[j]; } } cout << dp[n-1] << "\n"; }
#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...