Pagini recente » Cod sursa (job #2393408) | Cod sursa (job #2747365) | Cod sursa (job #466197) | Cod sursa (job #2666068) | Cod sursa (job #1849995)
#include <iostream>
#include <fstream>
using namespace std;
int maxsum,Min=1<<30,sum[50000],poz,start,finish;
int n,k;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
f >> n >> k ;
int x;
for(int i=1;i<=n;i++)
{
f >> x;
sum[i]=sum[i-1]+x;
if(i>=k)
{
if(sum[i-k]<Min)
{
Min=sum[i-k];
poz=i-k;
}
if(sum[i]-Min>maxsum)
{
maxsum=sum[i]-Min;
start=poz;
finish=i;
}
}
}
g << start+1 << " " << finish << " " << maxsum << "\n";
return 0;
}