Pagini recente » Cod sursa (job #2934322) | Cod sursa (job #910603) | Cod sursa (job #1493278) | Cod sursa (job #2825343) | Cod sursa (job #474193)
Cod sursa(job #474193)
#include<fstream>
using namespace std;
int S[6000001];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,k;
in>>n;
in>>k;
for(int i=1;i<=n;i++) in>>S[i];
int best=-int(2e9),min,idx=0,bgn,end;
for(int i=2;i<=n;i++)
{
S[i]+=S[i-1];
if(best<S[i]-min && i-idx>=k)
best=S[i]-min,bgn=idx+1,end=i;
if(min>S[i]&&n-idx-1>k)
min=S[i],idx=i;
}
out<<bgn<<" "<<end<<" "<<best;
return 0;
}