Pagini recente » Cod sursa (job #1808276) | Cod sursa (job #222802) | Cod sursa (job #2766619) | Cod sursa (job #1800083) | Cod sursa (job #1619737)
#include <iostream>
#include <fstream>
using namespace std;
int v[50003],s;
int main()
{
int n,k,x,y,mx,p;
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;}
}
s=mx;
int mx1=s;
int q;
while(p-x+1>k && mx-v[x]>=s)
{
mx-=v[x];
x++;
if(mx>mx1) {mx1=mx; q=x;}
}
g<<q<<" "<<p<<" "<<mx1;
return 0;
}