Pagini recente » Cod sursa (job #2377162) | Cod sursa (job #2699269) | Cod sursa (job #1999361) | Cod sursa (job #2778832) | Cod sursa (job #2590109)
//#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,x,d[N];
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{f>>x;
d[i]=x+d[i-1];}
//for(int i=2;i<=n;i++)
// d[i]=d[i-1]+v[i];
int st=1,dr=n,maxi=-25000*50000;
//for(int i=1;i<=n;i++)
// cout<<d[i]<<' ';
for(int i=1;i<=n-k+1;i++)
for(int j=k-1;j<=n-1;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;
}