Cod sursa(job #1535432)
Utilizator | Data | 24 noiembrie 2015 19:14:25 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,a[50005],dp[50005],sol=-1000000000,solst,soldr,dr,st,o,i;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
if(i<=k)o+=a[i];
}
dp[k]=sol=o;st=solst=1;dr=soldr=k;
for(i=k+1;i<=n;i++)
{
o=o+a[i]-a[i-k];
if(dp[i-1]+a[i]>=o){dp[i]=dp[i-1]+a[i];dr++;}
else
{
dp[i]=o;
dr++;
st=i-k+1;
}
if(dp[i]>sol){sol=dp[i];solst=st;soldr=dr;}
}
fout<<solst<<" "<<soldr<<" "<<sol<<"\n";
}