Pagini recente » Cod sursa (job #2223706) | Cod sursa (job #2440866) | Cod sursa (job #2527438) | Cod sursa (job #154797) | Cod sursa (job #1333188)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("secv2.in");
ofstream fout ("secv2.out");
int a,n,i,s,in,sf,insf,mini=2500000,sumMax=-2500000,r,v[500005],k;
int main ()
{
fin>>n;
fin>>k;
fin>>v[1];
for(i=2;i<=n;i++)
{
fin>>a;
v[i]=v[i-1]+a;
if(i>=k)
{
if(v[r]<mini)
{
mini=v[r];
in=r+1;
}
s=v[i]-mini;
if(s>sumMax)
{
sumMax=s;
insf=in;
sf=i;
}
r++;
}
}
fout<<insf<<" "<<sf<<" "<<sumMax;
fout.close();
fin.close();
return 0;
}