Pagini recente » Cod sursa (job #2541221) | Cod sursa (job #723473) | Cod sursa (job #1863799) | Cod sursa (job #2969906) | Cod sursa (job #2590137)
//#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,v[N],st,dr,prim;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{f>>x;
v[i]=x+v[i-1];}
//for(int i=2;i<=n;i++)
// d[i]=d[i-1]+v[i];
int mini=25000*50000,maxi=-25000*50000;
//for(int i=1;i<=n;i++)
// cout<<d[i]<<' ';
for(int i=k;i<=n;i++)
{
if(v[i-k]<mini)
{
mini=v[i-k];
prim=i-k+1;
}
if(v[i]-mini>maxi)
{
maxi=v[i]-mini;
st=prim;
dr=i;
}
}
g<<st<<' '<<dr<<' '<<maxi;
return 0;
}