제출 #1309708

#제출 시각아이디문제언어결과실행 시간메모리
1309708aaaaaaaaFeast (NOI19_feast)C++20
10 / 100
3 ms580 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int mxN = 81; int dp[mxN][mxN], a[mxN]; signed main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n, k; cin >> n >> k; for(int i = 1; i <= n; ++i){ cin >> a[i]; a[i] = a[i - 1] + a[i]; } for(int i = 1; i <= n; ++i){ for(int j = 1; j <= k; ++j){ dp[i][j] = max(dp[i - 1][j - 1], dp[i - 1][j]); for(int prev = i; prev >= 1; --prev){ dp[i][j] = max(dp[i][j], dp[prev - 1][j - 1] + a[i] - a[prev - 1]); } } } cout << dp[n][k] << "\n"; return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...