P2029 跳舞

Aimeee

对于本蒟蒻来说，直接写dp太难了

呜呜呜呜呜呜呜呜呜呜呜呜

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
//#define  int long long
using namespace std;
int n,t;
int Aimee[5005];
int R[5005];
int ans;
int dp[5005][5005];
int dfs(int now,int li,int la){
	if(dp[now][li])
	return dp[now][li];
	int jdn=-99999999;
	if(now==n+1){
	return 0;
	}
		if(li==t-1){
			jdn=max(jdn,dfs(now+1,0,now)+Aimee[now]+R[now]);
		}else{
			jdn=max(jdn,dfs(now+1,li+1,now)+Aimee[now]);
		}
	jdn=max(jdn,dfs(now+1,li,la)-Aimee[now]);
	return dp[now][li]=jdn; 
}
signed main(){
	scanf("%d%d",&n,&t);
	for(int i=1;i<=n;++i){
		scanf("%d",&Aimee[i]);
	}
	for(int i=1;i<=n;++i){
		scanf("%d",&R[i]);
	}
	cout<<dfs(1,0,0);
	return 0;
}