Pagini recente » Cod sursa (job #994606) | Cod sursa (job #2341632) | Cod sursa (job #2976001) | Cod sursa (job #2629363) | Cod sursa (job #1527904)
#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;
st=1; dr=K;
for(i=1;i<=K;++i) Sk+=X[i];
DP[K]=Sk; Sol=Sk;
for(i=K+1;i<=N;++i)
{
Sk=Sk+X[i]-X[i-K];
if(Sk>(DP[i-1]+X[i])) { st++; DP[i]=Sk; }
else DP[i]=DP[i-1]+X[i];
if(DP[i]>Sol)
{
Sol=DP[i];
dr=i;
}
}
}
int main()
{
fin>>N>>K;
for(int i=1;i<=N;++i)
{
fin>>X[i];
}
Solve();
fout<<st<<" "<<dr<<" "<<Sol<<"\n";
fin.close();
fout.close();
return 0;
}