Cod sursa(job #3153712)
Utilizator | Florea Andrei XTrim07 | Data | 30 septembrie 2023 20:58:32 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#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 = -1000000;
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;
}