제출 #848138

#제출 시각아이디문제언어결과실행 시간메모리
848138asd12343Feast (NOI19_feast)C++14
0 / 100
2 ms604 KiB
#include<bits/stdc++.h> #define el '\n' using namespace std ; const int MN = 5e3 + 10 ; const int mod = 1e9 + 7; mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); int Rand(int l, int h){ return l + (1LL * rd() * rd() % (h - l + 1) + (h - l + 1)) % (h - l + 1); } int a[MN] , n , k; int dp[3000][3000]; signed main (){ // freopen("FEAS.INP", "r", stdin); // freopen("FEAS.OUT", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for ( int i = 1 ; i <= n ; i++ ) cin >> a[i]; for (int i = 1 ; i <= n ; i++) { for (int j = 0 ; j <= k ; j++) { dp[i][j+1] = max(dp[i][j+1],dp[i-1][j]); dp[i][j] = max(dp[i][j],dp[i-1][j] + a[i]); } } int ans = 0; for ( int i = 0 ; i <= k ; i++ ) ans = max(ans , dp[n][i]); cout << ans; }
#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...