Pagini recente » Cod sursa (job #1080747) | Cod sursa (job #416558) | Cod sursa (job #1596305) | Cod sursa (job #56356) | Cod sursa (job #1382894)
# include <fstream>
# include <algorithm>
# define NR 12000
# define inf -999999999
using namespace std;
ifstream f("ferma.in");
ofstream g("ferma.out");
int i,j,n,m,k,maxx;
int a1[NR], a2[NR], b1[NR], b2[NR], x[NR];
int main ()
{
f>>n>>k;
for (i=1; i<=n; ++i) f>>x[i];
for (j=1; j<=k+1; ++j)
{
for (i=1; i<=n; ++i)
{
a2[i]=max(a2[i-1]+x[i], b1[i-1]+x[i]);
b2[i]=max(a2[i-1], b2[i-1]);
}
for (i=1; i<=n; ++i)
{
a1[i]=a2[i];
b1[i]=b2[i];
}
if (j==k) maxx=max (a1[n], b1[n]);
if (j==k+1) maxx=max (maxx, a1[n]);
}
if (maxx<0) g<<"0\n";
else g<<maxx<<"\n";
return 0;
}