Pagini recente » Cod sursa (job #1804320) | Cod sursa (job #3153539) | Cod sursa (job #2163005) | Cod sursa (job #1783430) | Cod sursa (job #1863005)
#include <iostream>
#include <climits>
#define DM 50005
#define x first
#define y second
using namespace std;
int maxS=LONG_LONG_MIN, mini=INT_MIN, ssp[DM], maxI, maxJ, I;
int main()
{
int n, k, m, t, centr, pet;
cin>>n>>k;
for(int i=1; i<=n; i++)
{
cin>>m;
ssp[i]=ssp[i-1]+m;
if(i>=k)
{
if(ssp[i-k]<mini)
mini=ssp[i-k], I=i-k;
if(ssp[i]-mini>maxS)
{
maxS=ssp[i]-mini;
maxI=I+1;
maxJ=i;
}
}
}
cout<<maxI<<" "<<maxJ<<" "<<maxS;
return 0;
}