Pagini recente » Cod sursa (job #779366) | Cod sursa (job #1028915) | Cod sursa (job #2300673) | Cod sursa (job #2357700) | Cod sursa (job #1347640)
#include <iostream>
#include <fstream>
using namespace std;
long long s[100000];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
long long i,n,k,sumamax,minim=2000000000,x,y,loc;
in>>n;
in>>k;
for (i=1;i<=n;i++)
{
in>>s[i];
s[i]+=s[i-1];
}
loc=0;
x=1;
y=k;
sumamax=s[k];
for (i=k+1;i<=n;i++)
{
if (s[i-k]<=minim)
{
minim=s[i-k];
loc=i-k;
}
if (s[i]-minim>=sumamax)
{
sumamax=s[i]-minim;
x=loc+1;
y=i;
}
}
out<<x<<" "<<y<<" "<<sumamax;
}