Pagini recente » Rating Bulancea Melutu-Iulian (bulancea_melutu) | Cod sursa (job #768497) | Cod sursa (job #1368275)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int NMAX=50005;
int n,k,a[NMAX];
int main()
{
int i,mn=1<<30,poz=0,sum=0,mx=-(1<<30),x,y;
fin>>n>>k;
for (i=1;i<=n;i++) fin>>a[i];
for (i=1;i<=k;i++) sum+=a[i];
for (i=k+1;i<=n;i++)
{
sum+=a[i];
if (a[i-k]<mn)
{
mn=a[i-k];
poz=i-k;
}
if ((sum-mn)>mx)
{
mx=sum-mn;
x=poz+1;y=i;
}
}
fout<<x<<" "<<y<<" "<<mx<<"\n";
return 0;
}