Cod sursa(job #1275408)
Utilizator | Radu Toporan RaduToporan | Data | 25 noiembrie 2014 08:11:10 |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <cstdio>
int s[50001],k,smax,n,i,x,mn,sum,stanga,dreapta;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=1; i<=n; i++)
{
scanf("%d",&x);
s[i]=s[i-1]+x;
}
mn=2000000;
for (i=k+1; i<=n; i++)
{
if (mn>s[i-k]) { mn=s[i-k];stanga=i-k+1;}
sum=s[i]-mn;
if (sum>smax) { smax=sum; dreapta=i;}
}
printf("%d %d %d",stanga,dreapta,smax);
return 0;
}