Mishka and Contest（水题）

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≤n,k≤100) — the number of problems in the contest and Mishka’s problem-solving skill.

The second line of input contains n integers a1,a2,…,an (1≤ai≤100), where ai 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
8 4
4 2 3 1 5 1 6 4
Output
5
Input
5 2
3 1 2 1 3
Output
0
Input
5 100
12 34 55 43 21
Output
5
Note
In the first example, Mishka can solve problems in the following order: [4,2,3,1,5,1,6,4]→[2,3,1,5,1,6,4]→[2,3,1,5,1,6]→[3,1,5,1,6]→[1,5,1,6]→[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.

题目大意：先输入一个数代表题目数量，再输入一个数代表会的题目的难度，当会的大于题目难度的时候，就可以解出来，答案+1.但他只能从前往后做和从后往前做当做不下时停下。

解题思路：先从前往后判断能做多少，再判断是不是全做出来了，要是没有全做出来再判断从后往前。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <string.h>
#define N 400010
using namespace std;
int main()
{
    int n,k,ans=0;
    int p[10001];
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i];
    }
    for(int i=1;i<=n;i++)
    {
        if(p[i]<=k)
            ans++;
        else
            break;
    }
    if(ans==n)
        cout<<ans<<endl;
    else
    {
        for(int i=n; i>=0; i--)
        {
            if(p[i]<=k)
                ans++;
            else
                break;
        }
        cout<<ans<<endl;
    }
    return 0;
}