Cod sursa(job #3154752)
Utilizator | Florea Andrei XTrim07 | Data | 5 octombrie 2023 22:27:28 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
v.push_back(x);
}
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 + 1 >= k && suma > suma_max) {
suma_max = suma;
indice_inc = i;
indice_final = j;
}
}
}
cout << indice_inc + 1 << ' ' << indice_final + 1 << ' ' << suma_max << '\n';
return 0;
}