Pagini recente » Cod sursa (job #2833369) | Cod sursa (job #704897) | Cod sursa (job #2828758) | Cod sursa (job #1843994) | Cod sursa (job #2265521)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k;
int sum[50001];
void secv();
int bestsum, lmax, rmax;
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
{
int nr;
fin>>nr;
sum[i]=sum[i-1]+nr;
}
bestsum=INT_MIN;
secv();
fout<<lmax<<' '<<rmax<<' '<<bestsum<<'\n';
return 0;
}
void secv()
{
int l=1;
int minim=0;
for(int i=k; i<=n; i++)
{
int s=sum[i]-minim;
if(sum[i-k]<minim)
{
minim=sum[i-k];
l=i-k+1;
}
if(s>bestsum)
{
bestsum=s;
lmax=l;
rmax=i;
}
}
}