Codeforces Round #490 (Div. 3) A. Mishka and Contest

最新推荐文章于 2022-05-06 12:55:01 发布

Cantredo

最新推荐文章于 2022-05-06 12:55:01 发布

阅读量360

点赞数

分类专栏：刷题及经验总结

本文链接：https://blog.csdn.net/CoLpac/article/details/80771103

版权

刷题及经验总结专栏收录该内容

58 篇文章 0 订阅

订阅专栏

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?

Input

The first line of input contains two integers $n$ and $k$ ( $1 \leq n, k \leq 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 \leq a_{i} \leq 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.

Output

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

   Examples 
 
     input 
    
      Copy 
    
8 4
4 2 3 1 5 1 6 4

     output 
    
      Copy 
    
5

     input 
    
      Copy 
    
5 2
3 1 2 1 3

     output 
    
      Copy 
    
0

     input 
    
      Copy 
    
5 100
12 34 55 43 21

     output 
    
      Copy 
    
5

Note

In the first example, Mishka can solve problems in the following order: $[4, 2, 3, 1, 5, 1, 6, 4] \to [2, 3, 1, 5, 1, 6, 4] \to [2, 3, 1, 5, 1, 6] \to [3, 1, 5, 1, 6] \to [1, 5, 1, 6] \to [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为能做出题的“最大难度”，可以从开头做到末尾，反之亦然，也可以从开头做到某题卡住了，再从末尾开始做，求此种策略下能做出的题的数量，即 a[i] <= k 的数量。

代码如下：

#include <iostream>
using namespace std ;

int main(){
    int n , k ;
    while ( cin >> n >> k ){
        int a[1005] ;
        for ( int i = 0 ; i < n ; i ++ ){
            cin >> a[i] ;
        }
        int num = 0 ;
        for ( int i = 0 , j = n - 1 ; i < n && j >= 0 ; ){
            if ( k >= a[i] ){
                num ++ ;
                i ++ ;
            }
            else if ( k >= a[j] ){
                num ++ ;
                j -- ;
            }
            else{
                break ;
            }
        }
        cout << num << endl ;
    }
    return 0 ;
}