Pagini recente » Cod sursa (job #958213) | Cod sursa (job #1599335) | Cod sursa (job #3156214) | Cod sursa (job #828580) | Cod sursa (job #470421)
Cod sursa(job #470421)
#include<fstream>
using namespace std;
int n,k,i,j,st=1,dr=1,maxim,s,x[6000001];
int main()
{
ifstream f("secv2.in");ofstream g("secv2.out");
f>>n>>k>>x[1];
maxim=x[1];
for(i=2;i<=n;i++)
f>>x[i];
i=st=dr=1;
s=maxim=0;
for(j=1;j<=n;j++)
{
s=s+x[j];
if(s>maxim && j-i>n-(n-k)){maxim=s;st=i;dr=j;}
else if(s<0)
{
if(maxim<0){maxim=0;st=dr=j;}
i=j+1;s=0;
}
}
g<<st<<' '<<dr<<' '<<maxim;
f.close();g.close();
return 0;
}