Pagini recente » Cod sursa (job #948953) | Cod sursa (job #1021555) | Cod sursa (job #1149022) | Cod sursa (job #1364011) | Cod sursa (job #1864319)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int k,n,c;
int b=-30001;
deque < pair < int , int > > coada;
int main()
{
int i;
int x;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>x;
while(!coada.empty() && coada.front().first>x)
coada.pop_front();
coada.push_front(make_pair(x,i));
if(i-coada.back().second>=k)
coada.pop_back();
if(coada.back().first>b)
{
b=coada.back().first;
c=coada.back().second;
}
}
fout<<c<<' '<<c+k-1<<' '<<b;
fin.close();
fout.close();
return 0;
}