Pagini recente » Cod sursa (job #224791) | Cod sursa (job #929706) | Cod sursa (job #1855039) | Cod sursa (job #1414574) | Cod sursa (job #2601489)
#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];
void read()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>a[i];
}
void solve()
{
int st,dr,ind=1;
ll sum=0,ans=-inf;
for(int i=1;i<=n;i++)
{
sum+=a[i];
while((i-ind+1>k) && sum-a[ind]>=sum)
{
sum-=a[ind];
++ind;
}
if(sum>=ans && (i-ind+1>=k))
{
ans=sum;
st=ind;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<ans;
}
int main()
{
read();
solve();
return 0;
}