Pagini recente » Cod sursa (job #1581523) | Cod sursa (job #1330219) | Cod sursa (job #904369) | Cod sursa (job #780612) | Cod sursa (job #1533363)
#include<fstream>
#define DM 50007
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int N,K,st,dr,Sol,Sk;
int X[DM],DP[DM];
void Solve()
{
int i,poz;
st=1; dr=K;
DP[K]=Sol=Sk;
for(i=K+1;i<=N;++i)
{
if(DP[i-1]>Sk) DP[i]=DP[i-1]+X[i];
else
{
DP[i]=Sk+X[i];
poz=i-K;
}
if(DP[i]>Sk)
{
st=poz;
dr=i;
Sol=DP[i];
}
Sk=Sk+X[i]-X[i-K];
}
}
int main()
{
fin>>N>>K;
for(int i=1;i<=N;++i)
{
fin>>X[i];
if(i<=K) Sk+=X[i];
}
Solve();
fout<<st<<" "<<dr<<" "<<Sol<<"\n";
fin.close();
fout.close();
return 0;
}