Cod sursa(job #2037725)
Utilizator | Data | 12 octombrie 2017 18:26:56 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int s[50005],n,k,x;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d %d\n%d", &n,&k,&s[1]);
for(int i=2;i<=n;i++)
{
scanf(" %d", &x);
s[i]=s[i-1]+x;
}
int sm=s[k], ps=1,pf=k,vs=0;
for(int i=1;i<=n-k;i++)
{
if(sm<s[i+k]-vs)
{
sm=s[i+k]-vs;
pf++;
}
if(vs>s[i])
{
vs=s[i];
ps=i+1;
}
}
printf("%d %d %d", ps, pf,sm);
return 0;
}