Pagini recente » Cod sursa (job #2131182) | Cod sursa (job #714281) | Cod sursa (job #2552806) | Cod sursa (job #2043339) | Cod sursa (job #2642780)
#include <fstream>
#include <deque>
using namespace std;
#define BUFSIZE 16384
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char readChar() {
sp++;
if(sp == BUFSIZE) {
sp = 0;
fread(buff, 1, BUFSIZE, fin);
}
return buff[sp];
}
public:
InParser(const char *nume) {
fin = fopen(nume, "r");
buff= new char [BUFSIZE]();
sp = BUFSIZE - 1;
}
InParser& operator >> (int &n) {
char ch;
while(!isdigit( ch = readChar()) && ch != '-' );
int sign = 1;
if(ch == '-') {
n = 0;
sign = -1;
}
else
n = ch - '0';
while( isdigit( ch = readChar() ) )
n = n * 10 + ch - '0';
n *= sign;
return *this;
}
};
InParser fin("secventa.in");
ofstream fout("secventa.out");
int v[500001];
deque<int> D;
int main() {
int n, k, b, e, vmax;
fin >> n >> k;
for(int i = 1; i <= n; i++)
fin >> v[i];
b = e = 0;
vmax = -30000;
for(int i = 1; i <= n; i++) {
while(!D.empty() && v[i] <= v[D.back()])
D.pop_back();
D.push_back(i);
if(i - k == D.front()) D.pop_front();
if(i >= k && v[D.front()] > vmax) {
vmax = v[D.front()];
b = i - k + 1; e = i;
}
}
fout << b << ' ' << e << ' ' << vmax << '\n';
return 0;
}