Pagini recente » Cod sursa (job #1989193) | Cod sursa (job #2366706) | Cod sursa (job #3181965) | Cod sursa (job #495180) | Cod sursa (job #2551980)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,x,ii,l;
long long dps[50005],summax,sum;
int main()
{
f>>n>>k;
for(int i=1; i<=n; i++)
{
f>>x;
dps[i]=x+dps[i-1];
}
for(int i=1; i<=n; i++)
for(int j=k;j<=n;j++)
{
if(sum<0)
sum=0;
else if(i>=j)
sum=dps[i-1]-dps[i-j-1];
if(sum>summax)
{
l=j;
ii=i;
summax=dps[i];
}
}
g<<ii-l<<" "<<ii<<" "<<summax;
return 0;
}