Pagini recente » Cod sursa (job #971241) | Cod sursa (job #2817550) | Cod sursa (job #2787851) | Cod sursa (job #2938346) | Cod sursa (job #1201612)
#include <iostream>
#include <fstream>
#include <deque>
#include <cstring>
using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int n, k;
int v[500001];
char s[3500001];
deque <int> d;
int nr (int &i) {
int x = 0;
while (isdigit(s[i])) {
x = x * 10 + s[i] - '0';
i++;
}
i--;
return x;
}
void citeste () {
f >> n >> k;
int semn = 1, x, p = 0;
f.get();
f.get(s, 3500000);
// cout << s;
int l = strlen(s) - 1;
// cout << l;
for (int i = 0; i < l; i++) {
if (s[i] == ' ') i++;
if (s[i] == '-') semn = -1, i++;
p++;
v[p] = semn * nr (i);
// cout << v[p] << ' ';
semn = 1;
}
}
void rezolva () {
int sol = -1, poz;
for (int i = 1; i <= n; i++) {
while (!d.empty () && v[d.back()] > v[i]) d.pop_back();
d.push_back(i);
if (i - d.front() == k) d.pop_front();
if (i >= k && v[d.front()] > sol) {
poz = i;
sol = v[d.front()];
}
}
g << poz - k + 1 << ' ' << poz << ' ' << sol << '\n';
}
int main () {
citeste ();
rezolva ();
return 0;
}