Cod sursa(job #2047199)
Utilizator | Data | 24 octombrie 2017 17:19:56 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[500001];
ifstream in("secventa.in");
ofstream out("secventa.out");
int main()
{
in >> n >> k;
int st = 0, i, dr = 0, M = 0, m, j;
for(i = 1; i <= n; i++)
in >> a[i];
for(i = 1; i <= n - k + 1; i++)
{
m = 100000;
for(j = i; j < i + k; j++)
{
m = min(m, a[j]);
}
if(M < m)
{
M = m;
st = i;
dr = i + k - 1;
}
}
out << st << " " << dr << " " << M;
in.close();
out.close();
return 0;
}