Cod sursa(job #2186590)
Utilizator | Data | 25 martie 2018 19:26:20 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
long long int N,K,Sum[50005],i,Mini,Raspuns,Inceput,Sfarsit,X,Pozmin;
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;
i=Pozmin+K;
for(;i<=N;++i)
{
if(Sum[i]-Mini>Raspuns) {Raspuns=Sum[i]-Mini; Inceput=Pozmin+1; Sfarsit=i;}
if(Sum[i]<Mini) {Mini=Sum[i]; Pozmin=i; i=Pozmin+K;}
}
fout<<Inceput<<' '<<Sfarsit<<' '<<Raspuns;
fin.close (); fout.close();
return 0;
}