Pagini recente » Cod sursa (job #2867418) | Cod sursa (job #1251855) | Cod sursa (job #2500494) | Cod sursa (job #640410) | Cod sursa (job #1555005)
#include<fstream>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,v[50003],i,a,mini,maxi,u[50003],pmin,pmax;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a;
v[i]=v[i-1]+a;
}
mini=25000;
maxi=-25000;
for(i=k;i<=n;i++)
{
if(v[i-k]<mini)
{
mini=v[i-k];
pmin=i-k+1;
}
if(v[i]-mini>maxi)
{
maxi=v[i]-mini;
pmax=i;
}
}
fout<<pmin<<" "<<pmax<<" "<<maxi;
fin.close();
fout.close();
return 0;
}