Pagini recente » Cod sursa (job #640068) | Cod sursa (job #207622) | Cod sursa (job #243752) | Cod sursa (job #1668993) | Cod sursa (job #1971763)
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int NMax=50005;
int x[NMax],N,i,k=0,l=0,s,sol,st,dr,K;
void Read(){
fin>>N>>K;
for(i=1;i<=N;i++){fin>>x[i];}
}
void Solve(){
sol=numeric_limits<int>::min() ;
for(i=1;i<=N;i++){
if(x[i] > s + x[i])
{s = x[i]; k=i; l=i;}
else
{s= s + x[i]; l++;}
if((s>sol)&&(l-k+1>=K))
{sol=s; dr=k; st=l;}
}
fout<<dr<<' '<<st<<' '<<sol<<'\n';
}
int main()
{
Read();
Solve();
return 0;
}