Pagini recente » Cod sursa (job #2281576) | Cod sursa (job #3252647) | Cod sursa (job #2460033) | Cod sursa (job #1016853) | Cod sursa (job #1700585)
#include<iostream>
#include<fstream>
#include<deque>
using namespace std;
fstream fin("secventa.in",ios::in),fout("secventa.out",ios::out);
deque<pair<int,int> > deq;
int main()
{
int n,k,i,j,a,maxi=-99999,gasit,poz;
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";
}