Pagini recente » Cod sursa (job #2366895) | Cod sursa (job #694930) | Cod sursa (job #208249) | Cod sursa (job #1468249) | Cod sursa (job #1274652)
#include <iostream>
#include <fstream>
#include <cstring>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
const int NMax = 500010;
const int CMax = 5000002;
int v[NMax];
char nr[NMax];
deque < int > d;
void chg()
{
int semn,j;
j = 1;
for(int i = 0; nr[i] != 0; i++){
semn = 1;
if(nr[i] == '-'){
semn = -1;
i++;
}
while(nr[i] >= '0' && nr[i] <= '9'){
v[j] = v[j] * 10 + nr[i] - '0';
i++;
}
v[j] = v[j] * semn;
j++;
}
}
int main()
{
int N,K,fata,spate,bmn = -NMax,pz,p;
f >> N >> K;
f.get();
f.getline(nr,CMax);
chg();
pz = K;
for(int i = 1; i <= N; i++){
while(!d.empty() && v[i] <= v[d.back()])
d.pop_back();
d.push_back(i);
if(i - d.front() >= K)
d.pop_front();
if(i >= K && v[d.front()] > bmn){
bmn = v[d.front()];
pz = i;
}
}
g << pz - K + 1<< " " << pz << " " << bmn;
f.close();
g.close();
return 0;
}