zoukankan      html  css  js  c++  java
  • CodeForces-999A-Mishka and Contest

    Mishka started participating in a programming contest. There are nn problems in the contest. Mishka's problem-solving skill is equal to kk.

    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 kk. When Mishka solves the problem, it disappears from the list, so the length of the list decreases by 11. 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 nn and kk (1n,k1001≤n,k≤100) — the number of problems in the contest and Mishka's problem-solving skill.

    The second line of input contains nn integers a1,a2,,ana1,a2,…,an (1ai1001≤ai≤100), where aiai is the difficulty of the ii-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][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][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 55.

    In the second example, Mishka can't solve any problem because the difficulties of problems from both ends are greater than kk.

    In the third example, Mishka's solving skill is so amazing that he can solve all the problems.

    AC代码:

    #include<bits/stdc++.h>
    using namespace std;


    int main()
    {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,k,a[110],flag1,flag2,cnt=0;
    cin>>n>>k;
    flag1=1,flag2=n;
    for(int i=1;i<=n;i++) cin>>a[i];


    while(flag1<=flag2)
    {
    while(a[flag1]<=k && flag1<=flag2)
    {
    cnt++;
    flag1++;
    }
    while(a[flag2]<=k && flag1<=flag2)
    {
    cnt++;
    flag2--;
    }
    if(a[flag1]>k&&a[flag2]>k) break;
    }

    cout<<cnt<<endl;

    return 0;
    }


  • 相关阅读:
    03继承与多态 动手动脑
    data whitening
    特征值和特征向量
    CRC算法
    python 二维字典
    协方差的计算与理解
    Differences between write through and write back
    Differences between page and segment
    虚拟内存和缓存区别
    Python: 统计一个文件中每个单词出现的次数
  • 原文地址:https://www.cnblogs.com/csushl/p/9386540.html
Copyright © 2011-2022 走看看