lanqiao1621 挑选子串

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=2009;
ll a[N];
ll t[N];
int main(){
  ll n,m,k;
  cin>>n>>m>>k;

  for(int i=1;i<=n;i++){
    cin>>a[i];
    if(a[i]>=m)t[i]=1;
  }

  ll ans=0;
  for(int i=1,j=0,num=0;i<=n;++i){
    while((i>j)||(j<=n-1&&num<k)){
      ++j;
      num=num+t[j];
    }
    if(num>=k){
      ans=ans+n-j+1;
    }
    num=num-t[i];
  }
  cout<<ans;
}