Pagini recente » Cod sursa (job #2116888) | Cod sursa (job #50680) | Cod sursa (job #863962) | Cod sursa (job #191959) | Cod sursa (job #3268277)
#include <fstream>
#include <string>
#include <deque>
#include <vector>
using namespace std;
ifstream cin ("secventa.in");
ofstream cout ("secventa.out");
int v[500001];
int main()
{
vector <int> init;
int n,k;
deque <int> dq;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>v[i];
if(i<=k)
{
while(dq.empty()==false and v[i]<=v[dq.back()])
dq.pop_back();
dq.push_back(i);
}
}
int maxval=-30001,st=1,dr=k;
for(int i=1;i<=n;i++)
{
while(dq.empty()==false and v[i]<=v[dq.back()])
dq.pop_back();
dq.push_back(i);
while(i-k+1>dq.front())
dq.pop_front();
if(v[dq.front()]>maxval)
{
maxval=v[dq.front()];
st=i-k+1;
dr=i;
}
}
cout<<st<<' '<<dr<<' '<<maxval;
return 0;
}