#include <iostream> #include <unordered_map> using namespace std; class Solution { public: int findNumOfSection(vector<int> arr, int k ,int t){ int ret = 0; unordered_map<int, int> record;//val:frequency //滑动窗口为[i,j] j=k+i-1; for (int i = 0 ; (k+i-1) < arr.size(); i++) { for (int j =i; j<= k+i-1; j++) { record[arr[j]]++; } for (unordered_map<int, int>::iterator iter = record.begin(); iter != record.end(); iter++){ if (iter->second >= t){ ret++; break; }else continue; } record.clear(); } return ret; } }; int main(int argc, char const *argv[]) { int n,k,t; if ( n<k || t<=0) { return 0; } while (cin>>n>>k>>t) { std::vector<int> vec; for (int i = 0; i < n; i++) { int temp; cin>>temp; vec.push_back(temp); } cout<<Solution().findNumOfSection(vec,k,t)<<endl; } return 0; }