Codeforces 999A Mishka and Contest

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/polanwind/article/details/88078196

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;

int n, k;
int temp[105];
int ans;
int cnt;

int main() {
	scanf("%d %d", &n, &k);
	for (int i = 1;i <= n;++i) {
		scanf("%d", &temp[i]);
		if (temp[i] > k) {
			cnt++;
		}
	}
	if (cnt == 0) {
		printf("%d\n", n);
	}
	else if (cnt == 1) {
		printf("%d\n", n - 1);
	}
	else {
		for (int i = 1;i <= n;++i) {
			if (temp[i] > k) {
				ans += (i - 1);
				break;
			}
		}
		for (int i = n;i >= 1;--i) {
			if (temp[i] > k) {
				ans += (n - i);
				break;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}