Cod sursa(job #3041797)
Utilizator | Ivanovici Vlad rutakate | Data | 1 aprilie 2023 16:15:28 |
---|---|---|---|
Problema | Secventa 2 | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int n, k, suma = 0, st, dr, max = 0;
fin >> n >> k;
int sir[n + 1];
fin >> sir[1];
for(int i = 2; i <= n; ++i) {
fin >> sir[i];
sir[i] += sir[i - 1];
}
for(int i = n; i >= 1; --i) {
for(int j = 1; j <= i; ++j) {
if(sir[i] - sir[j - 1] > max && i - j >= k) {
max = sir[i] - sir[j - 1];
st = j;
dr = i;
}
}
}
fout << st << " " << dr << " " << max;
return 0;
}