Pagini recente » Cod sursa (job #2956666) | Cod sursa (job #447256) | Cod sursa (job #550384) | Cod sursa (job #2164728) | Cod sursa (job #2844905)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long n, k, s[50001],i,x,j,mx=-26000,inceput,sfarsit;
int main()
{
fin >> n >> k;
for(i=1;i<=n;i++)
{
fin >> x;
s[i]=x+s[i-1];
}
for(i=1;i<=n-k+1;i++)
{
for(j=i+k-1;j<=n;j++)
if(s[j]-s[i-1]>mx) mx=s[j]-s[i-1],inceput=i,sfarsit=j;
}
fout <<inceput << " "<<sfarsit<< " "<<mx << endl;
}