Cod sursa(job #3317280)
| Utilizator | Data | 23 octombrie 2025 08:37:31 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main() {
int n, k;
fin >> n >> k;
int v[n + 1];
for (int i = 1; i <= n; i++)
fin >> v[i];
int maxi = -30001, fst = 0, sec = 0;
for (int i = 1; i <= n - k + 1; i++) {
int minim = v[i];
for (int j = i; j < i + k; j++) {
if (v[j] < minim)
minim = v[j];
}
if (minim > maxi) {
maxi = minim;
fst = i;
sec = i + k - 1;
}
}
fout << fst << ' ' << sec << ' ' << maxi;
return 0;
}
