Submission #848127

#	Time	Username	Problem	Language	Result	Execution time	Memory
848127		nguyennh	Feast (NOI19_feast)	C++14	0 / 100	13 ms	3420 KiB

feast

#include<bits/stdc++.h>
#define el '\n'
#define int long long
using namespace std ;

const int MN = 1e5 + 10 ;
const int N = 1005;
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);
}

inline void add(int &x , int val){
	if ( (x += val) >= mod ) x -= mod;
}

int a[MN] , n , k;
int dp[2005][2005];

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] = max(dp[i][j] , dp[i - 1][j] + a[i]);
			if ( j + 1 <= k ) dp[i][j + 1] = max(dp[i][j + 1] , dp[i - 1][j]);
		}
	}
	int ans = 0;
	for ( int i = 0 ; i <= k ; i++ ) ans = max(ans , dp[n][i]);
	cout << ans;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11
• Subtask 6: 0 / 20
• Subtask 7: 0 / 29