Pagini recente » Cod sursa (job #2270678) | Cod sursa (job #1199660) | Cod sursa (job #2834293) | Cod sursa (job #252864) | Cod sursa (job #1700589)
#include<iostream>
#include<fstream>
#include<deque>
using namespace std;
fstream fin("secventa.in",ios::in),fout("secventa.out",ios::out);
deque<pair<short,int> > deq;
int main()
{
int n,k,i,poz;
short a,maxi=-31000;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a;
if(!deq.empty() && deq.back().second<=i-k) deq.pop_back();
while(!deq.empty() && deq.front().first>=a) deq.pop_front();
deq.push_front(make_pair(a,i));
if(i>=k)
{
if(maxi<deq.back().first)
{
maxi=deq.back().first;
poz=i;
}
}
}
fout<<poz-k+1<<" "<<poz<<" "<<maxi<<"\n";
}