Pagini recente » Cod sursa (job #2852790) | Cod sursa (job #2778751) | Cod sursa (job #1138046) | Cod sursa (job #286685) | Cod sursa (job #542643)
Cod sursa(job #542643)
#include<iostream.h>
#include<fstream.h>
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,a[40000],u,x,y,n,max,sum,k,p,s[40000];
int main()
{
f>>n>>k;
max=-1234567891;
for (i=1; i<=n; i++)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
sum=s[k];
max=s[k];
p=1;
x=1;
u=k;
y=k;
for (i=k+1; i<=n; i++)
{
if (sum+a[i]<s[i]-s[i-k])
{
sum=s[i]-s[i-k];
u=i;
p=i-k+1;
}
else
{
sum+=a[i];
u=i;
}
if (sum>max)
{
max=sum;
x=p;
y=u;
}
}
g<<x<<" "<<y<<" "<<max;
f.close();
g.close();
return 0;
}