Pagini recente » Cod sursa (job #990691) | Cod sursa (job #2753748) | Cod sursa (job #1412428) | Cod sursa (job #286330) | Cod sursa (job #2808880)
#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,x,ma=-30005,l,r;
deque < int > dq;
vector < int > v;
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fin >> n >> k;
v.push_back(0);
for(int i=1;i<=n;i++)
{
fin >> x;
v.push_back(x);
while(!dq.empty() && v[dq.back()]>x)
dq.pop_back();
dq.push_back(i);
if(dq.front()==i-k)
dq.pop_front();
if(i>=k && v[dq.front()]>ma)
{
ma=v[dq.front()];
l=i-k+1;
r=i;
}
}
fout << l << " " << r << " " << ma;
return 0;
}