Pagini recente » Cod sursa (job #787775) | Cod sursa (job #2881270) | Cod sursa (job #468826) | Cod sursa (job #948198) | Cod sursa (job #530779)
Cod sursa(job #530779)
#include <fstream>
using namespace std;
const char InFile[]="ferma.in";
const char OutFile[]="ferma.out";
const int MaxN=10111;
const int MaxK=1024;
ifstream fin(InFile);
ofstream fout(OutFile);
int V[MaxN],N,K,A[MaxN][MaxK],B[MaxN][MaxK];
int main()
{
fin>>N>>K;
for(register int i=1;i<=N;++i)
{
fin>>V[i];
}
fin.close();
A[1][1]=V[1];
for(register int i=2;i<=N;++i)
{
for(register int j=1;j<=K;++j)
{
A[i][j]=max(A[i-1][j]+V[i],B[i-1][j-1]+V[i]);
B[i][j]=max(A[i-1][j],B[i-1][j]);
}
}
int sol=max(A[N][K],B[N][K]);
A[1][1]=V[1];
for(register int i=2;i<=N;++i)
{
for(register int j=1;j<=K+1;++j)
{
A[i][j]=max(A[i-1][j]+V[i],B[i-1][j-1]+V[i]);
B[i][j]=max(A[i-1][j],B[i-1][j]);
}
}
//sol=max(sol,A[N][K+1]);
sol=max(0,sol);
fout<<sol;
fout.close();
return 0;
}