Mishka and Contest

题意翻译

给出长度为 $n$ 的数列，每次只能删除右端或左端小于等于 $k$ 的数，求最多能删除几个数。 **【输入格式】** - 第一行 $n, k$； - 第二行输入 $n$ 个数，表示要删除的数列。 **【输出格式】** - 一个数，表示最多能删除几个数。

题目描述

Mishka started participating in a programming contest. There are $ n $ problems in the contest. Mishka's problem-solving skill is equal to $ k $ . Mishka arranges all problems from the contest into a list. Because of his weird principles, Mishka only solves problems from one of the ends of the list. Every time, he chooses which end (left or right) he will solve the next problem from. Thus, each problem Mishka solves is either the leftmost or the rightmost problem in the list. Mishka cannot solve a problem with difficulty greater than $ k $ . When Mishka solves the problem, it disappears from the list, so the length of the list decreases by $ 1 $ . Mishka stops when he is unable to solve any problem from any end of the list. How many problems can Mishka solve?

输入输出格式

输入格式

The first line of input contains two integers $ n $ and $ k $ ( $ 1 \le n, k \le 100 $ ) — the number of problems in the contest and Mishka's problem-solving skill. The second line of input contains $ n $ integers $ a_1, a_2, \dots, a_n $ ( $ 1 \le a_i \le 100 $ ), where $ a_i $ is the difficulty of the $ i $ -th problem. The problems are given in order from the leftmost to the rightmost in the list.

输出格式

Print one integer — the maximum number of problems Mishka can solve.

输入输出样例

输入样例 #1

8 4
4 2 3 1 5 1 6 4

输出样例 #1

5

输入样例 #2

5 2
3 1 2 1 3

输出样例 #2

0

输入样例 #3

5 100
12 34 55 43 21

输出样例 #3

5

说明

In the first example, Mishka can solve problems in the following order: $ [4, 2, 3, 1, 5, 1, 6, 4] \rightarrow [2, 3, 1, 5, 1, 6, 4] \rightarrow [2, 3, 1, 5, 1, 6] \rightarrow [3, 1, 5, 1, 6] \rightarrow [1, 5, 1, 6] \rightarrow [5, 1, 6] $ , so the number of solved problems will be equal to $ 5 $ . In the second example, Mishka can't solve any problem because the difficulties of problems from both ends are greater than $ k $ . In the third example, Mishka's solving skill is so amazing that he can solve all the problems.

题意翻译

给出长度为 $n$ 的数列，每次只能删除右端或左端小于等于 $k$ 的数，求最多能删除几个数。 **【输入格式】** - 第一行 $n, k$； - 第二行输入 $n$ 个数，表示要删除的数列。 **【输出格式】** - 一个数，表示最多能删除几个数。