Pagini recente » Cod sursa (job #2366816) | Cod sursa (job #3265498) | Cod sursa (job #1695309) | Cod sursa (job #1179523) | Cod sursa (job #1893303)
#include <cstdio>
#include <deque>
using namespace std;
const int DIM = 10000;
deque <int> dq;
int v[500005];
char buff[DIM];
int poz = 0;
void read(int &numar) {
numar = 0;
char semn = '+';
while(buff[poz] < '0' || buff[poz] > '9') {
semn = buff[poz];
poz ++;
if(poz == DIM) {
fread(buff, 1, DIM, stdin);
poz = 0;
}
}
while('0' <= buff[poz] && buff[poz] <= '9') {
numar = numar * 10 + (buff[poz] - '0');
poz ++;
if(poz == DIM) {
fread(buff, 1, DIM, stdin);
poz = 0;
}
}
if(semn == '-') {
numar = -numar;
}
}
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
int n, k, minim = -999999999, a, b;
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; ++ i) {
read(v[i]);
while(!dq.empty() && v[dq.back()] >= v[i]) {
dq.pop_back();
}
dq.push_back(i);
if(i - dq.front() + 1 > k) {
dq.pop_front();
}
if(i >= k) {
if(v[dq.front()] > minim) {
minim = v[dq.front()];
a = i - k + 1;
b = i;
}
}
}
printf("%d %d %d", a, b, minim);
return 0;
}