Pagini recente » Cod sursa (job #878205) | Cod sursa (job #861248) | Cod sursa (job #2074297) | Cod sursa (job #392461) | Cod sursa (job #1374438)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int maxi,maxif,inc,incf,sf,sff,a[50001],k,n;
void reset(int i,int x)
{
inc=i;
sf=i;
a[i]=x;
maxi=x;
}
int main()
{
int i,x;
a[0]=-1;
fin>>n>>k;
for(i=1; i<=n; i++)
{
fin>>x;
if(a[i-1]<0)
if(x<0) a[i]=a[i-1]+x;
else reset(i,x);
else
{
a[i]=a[i-1]+x;
sf++;
if(a[i]>maxi and sf-inc+1>=k)
{
maxi=a[i];
if(maxi>maxif)
{
maxif=maxi;
incf=inc;
sff=sf;
}
}
}
}
fout<<incf<<" "<<sff<<" "<<maxi<<endl;
return 0;
}