Cod sursa(job #375929)
Utilizator | Data | 20 decembrie 2009 13:23:25 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream.h>
#include<iostream.h>
int n,k,i,s[51000],a[51000],final,inceput;
int main()
{
int min,max;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
s[1]=a[1];
for(i=2;i<=n;i++)
s[i]=s[i-1]+a[i];
max=s[k];
inceput=1;
final=k;
min=1;
for(i=k+1;i<=n;i++)
{
if(s[min]>s[i-k])
min=i-k;
if(s[i]-s[min]>max)
{
max=s[i]-s[min];
inceput=min+1;
final=i;
}
}
g<<inceput<<' '<<final<<' '<<max;
return 0;
}