Pagini recente » Cod sursa (job #3000910) | Cod sursa (job #1112131) | Cod sursa (job #3031883) | Cod sursa (job #1283620) | Cod sursa (job #2666898)
#include <iostream>
#include <fstream>
#define inf 1e15
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
typedef long long ll;
const int nmax=50005;
int n,k;
ll a[nmax],sum[nmax];
void read()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>a[i];
sum[i]=sum[i-1]+a[i];
}
}
void solve()
{
int st,dr,ind;
ll mn=inf,mx=-inf;
for(int i=k;i<=n;i++)
{
if(sum[i-k]<mn)
mn=sum[i-k],ind=i-k+1;
if(sum[i]-mn>mx)
mx=sum[i]-mn,st=ind,dr=i;
}
fout<<st<<" "<<dr<<" "<<mx;
}
int main()
{
read();
solve();
return 0;
}