Pagini recente » Cod sursa (job #1567529) | Cod sursa (job #1073562) | Cod sursa (job #1860507) | Cod sursa (job #877790) | Cod sursa (job #1619715)
#include <iostream>
#include <fstream>
using namespace std;
int v[50003],s;
int main()
{
int n,k,a,x,y,mx,mx1,p,mx2;
mx2=mx1=mx=-int(2e9);
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
x=1;
y=k;
for(int i=1;i<=n;++i)
{
f>>v[i];
}
for(int i=1;i<=k;++i)
{
s+=v[i];
}
mx=s; p=y;
for(int i=k+1;i<=n;++i)
{
s+=v[i];
y++;
if(s>mx) {mx=s; p=y;}
}
while(p-x+1>k && mx-v[x]>=mx)
{
mx-=v[x];
x++;
}
g<<x<<" "<<p<<" "<<mx;
return 0;
}