제출 #1318813

#제출 시각아이디문제언어결과실행 시간메모리
1318813JohanBigger segments (IZhO19_segments)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int INF = 1e18; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int a[n + 1]; pair < int , int > dp[n + 1]; for(int i = 1; i <= n; i++){ cin >> a[i]; dp[i] = {1, a[i]}; } for(int i = 2; i <= n; i++){ int sum = a[i]; for(int j = 1; j < i; j++){ if(dp[j].second <= sum){ if(dp[j].first + 1 >= dp[i].first){ if(dp[j].first + 1 == dp[i].first){ dp[i].second = min(dp[i].second, sum); } else dp[i].second = sum; dp[i].first = dp[j].first + 1; } } sum += a[j]; } } cout << dp[n].first << endl; }
#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...