HDU 5806 - NanoApe Loves Sequence Ⅱ （BestCoder Round #86）

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 using namespace std;
 5 #define LL long long
 6 const int N = 200005;
 7 int t, n, m, k;
 8 int a[N];
 9 LL ans;
10 int main()
11 {
12     scanf("%d", &t);
13     while (t--)
14     {
15         scanf("%d%d%d", &n, &m, &k);
16         for (int i = 1; i <= n; i++)
17             scanf("%d", &a[i]);
18         ans = 0;
19         int j = 1, i = 1, size = 0;
20         while (i <= n && j <= n)
21         {
22             if (size < k) 
23             {
24                 if (a[j] >= m) size++;
25                 j++;
26             }
27             while (size == k)
28             {
29                 ans += n - (j-1) + 1;
30                 if (a[i] >= m) size--;
31                 i++;
32             }
33         }
34         printf("%I64d\n",ans);
35     }
36 }