Pagini recente » Istoria paginii problema/polig | Cod sursa (job #1045366) | Borderou de evaluare (job #1681755) | Cod sursa (job #307553) | Cod sursa (job #2092455)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long s,mx=INT_MIN;
int i,x,j,v[50005],n,k,p=1,u,all,pg,ug;
int main()
{
fin>>n>>k;
for (i=1; i<=n; i++)
{
fin>>x;
if (s>=0)
s+=x;
else
{
s=x;
p=i;
}
if (s>mx && i-p+1>=k)
{
ug=i;
mx=s;
pg=p;
}
all+=x;
}
fout<<pg<<" "<<ug<<" "<<mx;
return 0;
}