Cod sursa(job #1818517)
Utilizator | Geana Vlad GeanaVlad | Data | 29 noiembrie 2016 13:24:11 |
---|---|---|---|
Problema | Ferma | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ferma.in");
ofstream g("ferma.out");
int n,k,mx,i,v[10001],s[10001],j,a[1001][10001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
}
a[1][1]=v[1];
for(i=1;i<=k;i++)
for(j=1;j<=n;j++)
{
mx=0;
for(k=1;k<j;k++)
mx=max(mx,a[i-1][k]+s[j]-s[k-1]);
a[i][j]=max(a[i][j-1],mx);
}
g<<a[k][n];
}