Pagini recente » Cod sursa (job #1541860) | Cod sursa (job #89571) | Cod sursa (job #2598392) | Cod sursa (job #2531416) | Cod sursa (job #2587286)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int v[50001], Max, ipoz, jpoz, n, k;
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; i++)
{
fin >> v[i];
v[i] += v[i-1];
}
for(int i = k; i <= n; i++)
for(int j = 1; j <= n-i+1; j++)
{
if(v[j+i-1] - v[j-1] > Max)
Max = v[j+i-1] - v[j-1], ipoz = j, jpoz = j+i-1;
}
fout << ipoz << ' ' << jpoz << ' ' << Max;
return 0;
}