Pagini recente » Cod sursa (job #443293) | Cod sursa (job #1658194) | Borderou de evaluare (job #2065963) | Cod sursa (job #648270) | Cod sursa (job #2411287)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,v[50005],k,pi,pim,pfm,sm;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
int s=v[1];
sm=max(0,v[1]);
if(k==1)
sm=v[1];
pim=pfm=1;
pi=1;
for(int i=2;i<=n;i++)
{
s+=v[i];
if(i-pi+1>=k&&sm<s)
{
sm=s;
pim=pi;
pfm=i;
}
if(s<0)
{
if(sm<s&&k==1)
{
sm=s;
pim=i;
pfm=i;
}
s=0;
pi=i+1;
}
}
g<<pim<<" "<<pfm<<" "<<sm<<'\n';
return 0;
}