Pagini recente » Cod sursa (job #2664285) | Cod sursa (job #1472888) | Cod sursa (job #1466598) | Cod sursa (job #324787) | Cod sursa (job #2590096)
//#include <fstream>
//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
const int N=50010;
int n,k,v[N],d[N];
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
d[1]=v[1];
for(int i=2;i<=n;i++)
d[i]=d[i-1]+v[i];
int st=1,dr=0,maxi=d[1];
//for(int i=1;i<=n;i++)
// cout<<d[i]<<' ';
for(int i=1;i<=n;i++)
for(int j=k-1;j<=n;j++)
{
if(d[i+j]-d[i-1]>maxi)
{
maxi=d[i+j]-d[i-1];
st=i;
dr=i+j;
}
}
g<<st<<' '<<dr<<' '<<maxi;
return 0;
}