Pagini recente » Cod sursa (job #724081) | Cod sursa (job #1660542) | Cod sursa (job #2845139) | Cod sursa (job #271060) | Cod sursa (job #2620316)
#include <cstdio>
#include <cctype>
using namespace std;
const int NMAX = 500000;
const int NINF = -2.e9;
int v[NMAX + 5] , l[NMAX + 5] , st[NMAX + 5];
char buffer[1 << 17];
int sz = (1 << 17) , crs = (1 << 17);
void get_int(int &n)
{
for( ; crs < sz && !isdigit(buffer[crs]) ; crs ++);
if(crs == sz)
{
fread(buffer , sz , 1 , stdin);
crs = 0;
for( ; crs < sz && !isdigit(buffer[crs]) ; crs ++);
}
n = 0;
for( ; crs < sz && isdigit(buffer[crs]) ; crs ++)
n = n * 10 + buffer[crs] - '0';
if(crs == sz)
{
fread(buffer , sz , 1 , stdin);
crs = 0;
for( ; crs < sz && isdigit(buffer[crs]) ; crs ++)
n = n * 10 + buffer[crs] - '0';
}
}
int main()
{
freopen("secventa.in" , "r" , stdin);
freopen("secventa.out" , "w" , stdout);
int n , i , k , x , base , top;
get_int(n);
get_int(k);
base = NINF;
top = 0;
for(i = 1 ; i <= n ; i ++)
{
get_int(v[i]);
while(top > 0 && v[st[top]] >= v[i])
top --;
l[i] = st[top];
st[++ top] = i;
}
st[0] = n + 1;
top = 0;
for(i = n ; i >= 1 ; i --)
{
while(top > 0 && v[st[top]] >= v[i])
top --;
if(st[top] - l[i] - 1 >= k && v[i] >= base)
{
base = v[i];
x = l[i] + 1;
}
st[++ top] = i;
}
printf("%d %d %d\n" , x , x + k - 1 , base);
return 0;
}