제출 #1270373

#제출 시각아이디문제언어결과실행 시간메모리
1270373zulmuwBigger segments (IZhO19_segments)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int n; int v[500005], dp[500005]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i=1; i<=n; ++i) { cin >> v[i]; } int bfr = v[1], cnt = 1; dp[1] = 1; for (int i=2; i<=n; ++i) { int cur = v[i], now = i; for (int j=i-1; j > 0; --j) { if (cur >= bfr) break; cur += v[j]; now = j; } dp[i] = dp[now-1] + 1; } // for (int i=0; i<=n; ++i) { // cout << dp[i] << " "; // } cout << dp[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...