Cod sursa(job #3191909)
| Utilizator | Data | 10 ianuarie 2024 21:47:08 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k, a[500005], maxim, solmaxim, st, dr;
int main()
{
int i,x;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> a[i];
for (st = 1,dr=k; dr <= n; dr++,st++)
{
maxim = 1e9;
for (i = st; i <= dr; i++)
if (a[i] < maxim)maxim = a[i];
if (maxim >= solmaxim)
{
solmaxim = maxim;
x = st;
}
}
fout << x << " " << x+k-1 << " " << solmaxim;
return 0;
}