Pagini recente » Cod sursa (job #667137) | Cod sursa (job #1344911) | Cod sursa (job #899567) | Cod sursa (job #2934957) | Cod sursa (job #2324036)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,x,i,dp[50005],minim,maxi,drpt,stg,pozmin;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>x;
dp[i]=dp[i-1]+x;
if(i==k)
{
minim=dp[i-k];
pozmin=i-k;
}
if(i>k)
{
if(dp[i-k]<minim)
{
minim=dp[i-k];
pozmin=i-k;
}
}
if(i==k)
{
stg=1;
drpt=i;
maxi=dp[i];
}
if(i>k)
{
if(minim<0)
{
if(maxi<dp[i]-minim)
{
maxi=dp[i]-minim;
stg=pozmin +1;
drpt=i;
}
}
}
}
fout<<stg<<" "<<drpt<<" "<<maxi;
return 0;
}