3247000_mle.cpp

来自「部分PKU上的源码」· C++ 代码 · 共 24 行

#include <iostream>
#include <string>
using namespace std;
int re[30001][101];
int n,k,t,i,j,mmm=0;
struct input
{int time,prosperity,stoutness;
 };
 input x[100];
 int max(int a,int b,int c)
 {return (a>b?a:b)>c?(a>b?a:b):c;}
int main ()
{memset(re,0,101*30001);
 cin>>n>>k>>t;
for(i=0;i<n;i++) cin>>x[i].time;
for(i=0;i<n;i++) cin>>x[i].prosperity;
for(i=0;i<n;i++) cin>>x[i].stoutness;
for(i=0;i<n;i++) re[x[i].time][x[i].stoutness]=x[i].prosperity;
for(i=1;i<=t;i++) 
 for(j=1;j<=k&&j<i;j++) re[i][j]+=max(re[i-1][j-1],re[i-1][j],re[i-1][j+1]);
for(j=1;j<=k;j++) if(re[t][j]>mmm) mmm= re[t][j];
cout<<mmm;
return 1;
}