Pagini recente » Cod sursa (job #1996499) | Cod sursa (job #1484374) | Cod sursa (job #1355533) | Cod sursa (job #2892207) | Cod sursa (job #1745602)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
const int NMAX=500005;
#define f first
#define s second
char s[3000100];
int v[NMAX],p;
deque<int> DQ;
void read(int &x) {
x=0;
bool sign=false;
if(s[p]=='-')
sign=true,p++;
while(s[p]>='0'&&s[p]<='9')
x=x*10+(s[p]-'0'),p++;
p++;
if(sign)
x*=-1;
}
int main()
{
int n,x;
int nr=-999999;
int poz;
register int i;
register int k;
in.getline(s,3000100);
read(n);
read(k);
in.getline(s,3000100);
p=0;
int m;
for(i=1; i<k; i++)
{
read(m);
v[i]=m;
while(DQ.empty()!=1 && v[DQ.back()]>v[i])
{
DQ.pop_back();
}
DQ.push_back(i);
}
for(i=k; i<=n; i++)
{
read(m);
v[i]=m;
while(DQ.empty()!=1 && v[DQ.back()]>v[i])
{
DQ.pop_back();
}
DQ.push_back(i);
if(DQ.front()<=i-k)
{
DQ.pop_front();
}
if(v[DQ.front()]>nr)
{
nr=v[DQ.front()];
poz=i;
}
}
out<<poz-k+1<<" "<<poz<<" "<<nr;
}