Pagini recente » Cod sursa (job #189652) | Cod sursa (job #1478697) | Cod sursa (job #2174308) | Cod sursa (job #177877) | Cod sursa (job #1677525)
#include<fstream>
using namespace std;
long n,k,i,v[50010],pin,psf,maxsum,s[50010],p;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i+1]=s[i]+v[i];
}
p=0;
for(i=k;i<=n;i++)
{
if(s[i+1]-s[p]>maxsum)
{
maxsum=s[i+1]-s[p];
pin=p+1;
psf=i+1;
}
if(s[i-k+2]<s[p])
{
p=i-k+2;
}
}
g<<pin-1<<" "<<psf-1<<" "<<maxsum;
f.close();
g.close();
return 0;
}