#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 30100;
const int N = 105;
int d[maxn][105];
int c[maxn][105],t[N],p[N],s[N],n,k,T;
int vis[maxn][105];
int dp(int i,int j){
if(vis[i][j]) return d[i][j];
vis[i][j] = true;
if(i==T+1){
return d[i][j] = 0;
}
d[i][j] = 0;
if(j>0)d[i][j]=max(d[i][j],dp(i+1,j-1)+c[i][j]);......
阅读全文