Pagini recente » Cod sursa (job #124180) | Cod sursa (job #89873) | Cod sursa (job #35499) | Cod sursa (job #1657760) | Cod sursa (job #2440055)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int n,k;
in>>n>>k;
int vec[n+1];
vec[0]=0;
int maxsuma=+79670547119,inceput=1,sfarsit=k;
int m=1250000009,p;
for(int i=1; i<=n; i++)
{
int a;
in>>a;
vec[i]=vec[i-1]+a;
}
for (int i = k; i <= n; i++) {
if (vec[i - k] < m)
{
m = vec[i - k];
p = i - k + 1;
}
if (vec[i] - m > maxsuma)
{
maxsuma = vec[i] - m;
inceput = p;
sfarsit = i;
}
}
out<<inceput<<" "<<sfarsit<<" "<<maxsuma;
return 0;
}