Pagini recente » Cod sursa (job #2365799) | Cod sursa (job #1668274) | Cod sursa (job #788827) | Cod sursa (job #1667141) | Cod sursa (job #2044399)
#include <fstream>
#include <deque>
#define nmax 500001
using namespace std;
ifstream fin( "secventa.in" );
ofstream fout( "secventa.out" );
int a[nmax], n, k;
int b, x, y;
deque <int> d;
void citire()
{
int i;
fin >> n >> k;
for ( i = 1; i <= n; ++i )
fin >> a[i];
}
void solve()
{
int i;
for ( i = n - k + 1; i >= 1; --i )
{ while ( !d.empty() && a[i] > a[d.front()] )
d.pop_front();
d.push_front(i);
}
}
void afisare()
{
solve();
fout << d.back() << " " << n << " " << a[d.back()];
}
int main()
{ citire();
solve();
afisare();
return 0;
}