제출 #912251

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
912251		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	63 / 100	2437 ms	262144 KiB

triusis

#include <bits/stdc++.h>
#define f first
#define s second	
#define ent '\n'
#define int long long

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

using namespace std;
typedef long long ll;
const int mx=1e6+12;
const int mod=1e9+7;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};

int dp[5001][5001];
int a[mx];
int n,m,k;

void Press_Fn_with_F11(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int x=1;x<=5000;x++){
		dp[0][x]=-1e18;
	}
	dp[0][0]=0;
	for(int i=1;i<=n;i++){
		for(int x=0;x<=i;x++){
			dp[i][x]=-1e18;
			if(a[i]<=dp[i-1][x]+m)dp[i][x]=a[i];
			if(x>0)dp[i][x]=max(dp[i][x],dp[i-1][x-1]+m);
		}
	}
	for(int i=0;i<=n;i++){
		if(dp[n][i]>=0){
			cout<<i<<ent;
			return;
		}
	}
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int Alikhan_abi_crush=1;
	// cin>>Alikhan_abi_crush;
	while(Alikhan_abi_crush--){
		Press_Fn_with_F11();
	}
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 0 / 37