Pagini recente » Cod sursa (job #808660) | Borderou de evaluare (job #2111036) | Cod sursa (job #3277668) | Cod sursa (job #1879930) | Cod sursa (job #2186605)
#include <fstream>
using namespace std;
long long int N,K,i,X,Sum[50005],Mini,Pozmin,Raspuns,Inceput,Sfarsit;
int main()
{
ifstream fin("secv2.in"); ofstream fout("secv2.out");
fin>>N>>K;
for(i=1;i<=N;++i) {fin>>X; Sum[i]=Sum[i-1]+X;}
Mini=0; Pozmin=0;
for(i=K;i<=N;++i)
{
if(Sum[i]-Mini>Raspuns) {Raspuns=Sum[i]-Mini; Inceput=Pozmin+1; Sfarsit=i;}
if(Mini>Sum[i+1-K]) {Mini=Sum[i+1-K]; Pozmin=i+1-K;}
}
fout<<Inceput<<' '<<Sfarsit<<' '<<Raspuns;
fin.close (); fout.close();
return 0;
}