Pagini recente » Cod sursa (job #3172566) | Cod sursa (job #1424765) | Cod sursa (job #1870667) | Cod sursa (job #2758794) | Cod sursa (job #1722224)
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque <int> d, q;
int v[500001], i, n, pozi, pozf, k, val = -31000;
class InputReader {
public:
InputReader() {}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(int &n) {
while(buffer[cursor] < '0' || buffer[cursor] > '9') {
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
};
int main()
{
InputReader cin("secventa.in");
ofstream cout("secventa.out");
cin >> n >> k;
for (i = 1; i <= n; ++ i)
{
cin >> v[i];
while (!d.empty() && v[d.back()] > v[i])
d.pop_back();
d.push_back(i);
if (d.front() <= i - k)
d.pop_front();
if (v[d.front()] > val && i >= k)
{
val = v[d.front()];
pozf = i;
}
}
cout << pozf - k + 1 << " " << pozf << " " << val;
return 0;
}