#include <bits/stdc++.h>
using namespace std;
const int N = 1e3;
int a[N];
int main()
{
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int ans = 0;
for (int i = 1, j = 0, cnt = 0; i <= n ; ++i)
{
while (i > j || (j + 1 <= n && cnt < k))
cnt+=(a[++j]>=m);
if (cnt >= k)
ans += n - j + 1;
cnt-=(a[i] >= m);
}
cout <<ans<<'\n';
return 0;
}
挑选子串 双指针 快慢指针
最新推荐文章于 2024-07-19 15:45:46 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)