Pagini recente » Rating Ile Paul (lauyoo46) | Cod sursa (job #230153) | Cod sursa (job #1180548) | Cod sursa (job #1449776) | Cod sursa (job #2430170)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int k,n;
int s[50010];
int calc[50010];
int main()
{
fin>>n>>k;
for(int i = 1;i<=n;i++)
fin>>s[i],s[i]+=s[i-1];
int minimum=1000000,minIndex;
for(int i = k;i<=n;i++)
{
if(s[i-k+1] < minimum)
minimum = s[i-k+1],minIndex = i-k+1;
calc[i] = minIndex;
}
int bestSuma = -1000000,start,stop;
for(int i = k;i<=n;i++)
{
if(bestSuma<s[i]-s[calc[i]])
{
bestSuma=s[i]-s[calc[i]];
start = calc[i]+1,stop =i;
}
}
fout<<start<<" "<<stop<<" "<<bestSuma<<'\n';
return 0;
}