Pagini recente » Cod sursa (job #153721) | Cod sursa (job #2488046) | Cod sursa (job #2363742) | Istoria paginii utilizator/vladstoick | Cod sursa (job #1058963)
#include <iostream>
#include <deque>
#include <utility>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
deque < pair <int,long> > my_deq;
long n,k,i;
int x;
f>>n;
f>>k;
f>>x;
my_deq.push_back(make_pair(x,1));
for (i=2;i<=n;i++)
{
f>>x;
if (my_deq.back().first<x&&k<=n-i+1){
my_deq.push_back(make_pair(x,i));}
/*y=i;
z=my_deq.front().second;
cout<<z;
while (z!=y){
my_deq.pop_front();
z=my_deq.front().second;
cout<<z;
}*/
}
/*while (!my_deq.empty()){
cout<<my_deq.front().first;
my_deq.pop_front();}*/
x=my_deq.back().second;
g<<x<<" "<<x+k-1<<" "<<my_deq.back().first;
return 0;
f.close();
g.close();
}