Pagini recente » Cod sursa (job #2690531) | Cod sursa (job #2220327) | Cod sursa (job #1240832) | Cod sursa (job #2527079) | Cod sursa (job #2627645)
#include <bits/stdc++.h>
#define N 50000
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int i,n,k,a[N+5],ct=0,p,u;long long S=0,smax=-2e12;
fin>>n>>k;
for(i=1;i<=n;i++) fin>>a[i];
for(i=1;i<=n;i++)
{
if(S<0 && ct<k) S+=a[i],ct++;
else if(S<0) S=a[i],ct=1;
else S+=a[i],ct++;
if(ct>=k && S>smax) smax=S,u=i,p=i-ct+1;
}
fout<<p<<" "<<u<<" "<<smax;
return 0;
}