Pagini recente » Atasamentele paginii wellcodesimulareclasa11-12-10martie | Monitorul de evaluare | Atasamentele paginii Clasament oni_2012_ziua1 | Cod sursa (job #1465744) | Cod sursa (job #2045201)
#include <bits/stdc++.h>
#define BufferSize 500000
#define Nmax 500001
using namespace std;
int n,k,v[Nmax],lst,mx=-1e7,sav,fst;
int Qv[Nmax],Qp[Nmax];
char buffer[BufferSize+1];
int pos;
bool digit(char c)
{
if (c>='0' && c<='9') return 1;
return 0;
}
void read(int &x)
{
char c;
while (!digit(buffer[pos]))
{
c = buffer[pos];
pos++;
if (pos==BufferSize)
fread(buffer,1,BufferSize,stdin),pos = 0;
}
while (digit(buffer[pos]))
{
x = x*10+buffer[pos]-'0';
pos++;
if (pos==BufferSize)
fread(buffer,1,BufferSize,stdin),pos = 0;
}
if (c=='-')
x = -x;
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
fread(buffer,1,BufferSize,stdin);
read(n);
read(k);
for (int i=1;i<=n;i++)
{
read(v[i]);
while (lst<=fst && Qv[fst]>=v[i])
fst--;
Qv[++fst] = v[i];
Qp[fst] = i;
if (Qp[lst]<i-k+1)
lst++;
if (mx<Qv[lst] && i>=k)
{mx = Qv[lst],sav = i-k+1;}
}
cout<<sav<<' '<<sav+k-1<<' '<<mx;
return 0;
}