Pagini recente » Cod sursa (job #1107152) | Cod sursa (job #1659296) | Cod sursa (job #1136794) | Cod sursa (job #706754) | Cod sursa (job #2113099)
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
const int N = 500000, oo = -30001;
int n, k, dq[N], v[N];
int main()
{
int st = 0, dr = -1, m = oo, poz = 0;
in >> n >> k;
for (int i = 0; i < n; i++) {
in >> v[i];
if (st <= dr && i - k == dq[st]) st++;
while (st <= dr && v[i] <= v[dq[dr]]) dr--;
dq[++dr] = i;
if (i >= k - 1) {
if (m <= v[dq[st]]) {
m = v[dq[st]];
poz = dq[st];
}
//out << v[dq[st]] << ' ';
}
}
//out << '\n';
out << poz + 1 << ' ' << poz + k << ' ' << m;
}