Pagini recente » Cod sursa (job #861634) | Clasament preoni42a | Cod sursa (job #2185465) | Cod sursa (job #1952611) | Cod sursa (job #1530225)
//#include<iostream>
#include<fstream>
#include<deque>
#define mkp (make_pair)
using namespace std;
ifstream si("secventa.in");
ofstream so("secventa.out");
/*#include<cstdio>
FILE* si=fopen("aranjamente.in","r");
FILE* so=fopen("aranjamente.out","w");
//*/
deque< pair<int,int> > v;
inline void adaug(int el,int poz)
{
while(!v.empty()&&v.back().first>=el)
{
v.pop_back();
}
v.push_back(mkp(el,poz));
return;
}
int main()
{
int n,k;
si>>n>>k;
int i,a;
for(i=0;i<k;++i)
{
si>>a;
adaug(a,i);
}
int maxx=v.front().first,poz=0;
for(i=k;i<n;++i)
{
si>>a;
adaug(a,i);
if(v.front().second<=i-k)
{
v.pop_front();
}
if(maxx<v.front().first)
{
maxx=v.front().first;
poz=i-k+1;
}
}
so<<poz+1<<' '<<poz+k<<' '<<maxx<<'\n';
}