Pagini recente » Autentificare | Cod sursa (job #703089) | Profil UVT_BUTUNOI_CARTIS_CHEROIU-COZMA | Cod sursa (job #50764) | Cod sursa (job #3153506)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
int indice_inc = 1, indice_final = 1, suma_max = INT_MIN;
for (int i = 1; i <= n; ++i) {
int suma = 0;
for (int j = i; j <= n; ++j) {
suma += v[j];
if (j - i >= k && suma > suma_max) {
suma_max = suma;
indice_inc = i;
indice_final = j;
}
}
}
cout << indice_inc << ' ' << indice_final << ' ' << suma_max << '\n';
return 0;
}