Pagini recente » Cod sursa (job #1053812) | Cod sursa (job #830899) | Cod sursa (job #251926) | Cod sursa (job #2635901) | Cod sursa (job #1261149)
#include <fstream>
#include <deque>
#define DIM 500011
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,nr,p,u;
int v[DIM];
pair<int,int> sol;
deque<int> q;
int main(void){
register int i,j;
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i],sol.first=min(sol.first,v[i]);
p=1;
q.push_back(v[1]);
for(i=2;i<=n;i++){
while(v[i]<v[q.back()]) q.pop_back();
q.push_back(i);
if(q.front()==i-k) q.pop_front();
if(!q.empty() && v[q.front()]>sol.first)
sol.first=v[q.front()],sol.second=i-k+1;
}
g<<sol.second<<" "<<sol.second+k-1<<" "<<sol.first;
f.close();
g.close();
return 0;
}