Pagini recente » Cod sursa (job #2646389) | Cod sursa (job #2757081) | Cod sursa (job #2450458) | Cod sursa (job #111299) | Cod sursa (job #1535419)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,a[50005],dp[50005],sol,solst,soldr,dr,st,o,i;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
if(i<=k)o+=a[i];
}
dp[k]=sol=o;st=solst=1;dr=soldr=k;
for(i=k+1;i<=n;i++)
{
o+=a[i]-a[i-k];
if(dp[i-1]+a[i]>o){dp[i]=dp[i-1]+a[i];dr=i;}
else
{
dp[i]=o;
dr=i;
st=i-k;
}
if(dp[i]>sol){sol=dp[i];solst=st;soldr=dr;}
}
fout<<solst+1<<" "<<soldr<<" "<<sol<<"\n";
}