Pagini recente » Cod sursa (job #1001796) | Cod sursa (job #1737936) | Cod sursa (job #2701939) | Cod sursa (job #1596803) | Cod sursa (job #1528954)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque< pair<int,int> > p;
int n,k,i,x,poz;
int vmax=-1000000000;
int main()
{
fin>>n>>k;
for(i=1;i<k;i++)
{
fin>>x;
while(p.size()&&p.back().second>=x)
p.pop_front();
p.push_back(make_pair(i,x));
}
for(;i<=n;i++)
{
fin>>x;
while(p.size()&&p.back().second>=x)
p.pop_back();
p.push_back(make_pair(i,x));
if(i-p.front().first==k)
p.pop_front();
if(vmax<p.front().second)
{
vmax=p.front().second;
poz=i;
}
}
fout<<poz-k+1<<' '<<poz<<' '<<vmax;
return 0;
}