Pagini recente » Cod sursa (job #3188628) | Cod sursa (job #1041181) | Cod sursa (job #1231627) | Cod sursa (job #2387692) | Cod sursa (job #530878)
Cod sursa(job #530878)
#include <fstream>
#include <cstdio>
using namespace std;
const char InFile[]="ferma.in";
const char OutFile[]="ferma.out";
const int MaxN=10002;
const int MaxK=1003;
ifstream fin(InFile);
ofstream fout(OutFile);
int N,K,A[MaxN][MaxK],B[MaxN][MaxK],V[MaxN],sol;
int main()
{
fin>>N>>K;
for(register int i=1;i<=N;++i)
{
fin>>V[i];
}
fin.close();
memset(A,-128,sizeof(A));
memset(B,-128,sizeof(B));
A[1][1]=V[1];
//B[1][1]=0;
for(register int i=2;i<=N;++i)
{
for(register int j=1;j<=K;++j)
{
A[i][j]=max(max(A[i-1][j],B[i-1][j-1]),A[i-1][j-1]);
B[i][j]=max(A[i-1][j],B[i-1][j]);
A[i][j]+=V[i];
}
}
sol=max(sol,max(A[N][K],B[N][K]));
++K;
memset(A,-128,sizeof(A));
memset(B,-128,sizeof(B));
A[1][1]=V[1];
A[2][1]=V[1]+V[2];
A[2][2]=V[1]+V[2];
B[2][1]=V[1];
for(register int i=3;i<=N;++i)
{
for(register int j=1;j<=K;++j)
{
A[i][j]=max(max(A[i-1][j],B[i-1][j-1]),A[i-1][j-1]);
B[i][j]=max(A[i-1][j],B[i-1][j]);
A[i][j]+=V[i];
}
}
sol=max(sol,A[N][K]);
fout<<sol;
fout.close();
return 0;
}