Pagini recente » Cod sursa (job #2892045) | Cod sursa (job #1172829) | Cod sursa (job #892779) | Clasament contest_1 | Cod sursa (job #712866)
Cod sursa(job #712866)
#include<fstream>
#include<deque>
#define dim 500002
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,i,v[dim],baza,fin,st;
deque<int>q;
int main (){
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
q.push_back(i);
for(i=2;i<k;++i){
while(!q.empty() && v[i]<=v[q.back()])
q.pop_back();
q.push_back(i);
}
baza=-1000000;
st=fin=1;
for(i=k;i<=n;++i){
while(!q.empty() && v[i]<=v[q.back()])
q.pop_back();
q.push_back(i);
if(v[q.front()]>=baza){
baza=v[q.front()];
st=i-k+1;
fin=i;
}
while(q.front()<=i-k+1)
q.pop_front();
}
g<<st<<" "<<fin<<" "<<baza<<"\n";
return 0;
}