问题 1175. -- count

1175: count

时间限制: 2 Sec  内存限制: 128 MB
提交: 106  解决: 40
[提交][状态][讨论版]

题目描述

There is a sequence with n integers, your task is finding there are how many consecutive subsequences have two characters:
1.The length of the subsequence is k.
2.Every number in this subsequence is different.

输入

The input contains multiple test cases.
The first line of each case contains two integers n and k (1≤k≤n≤200000). Then second line contains n positive integers a[i](1≤a[i]≤1000000000).

输出

For each case ,print the number of consecutive subsequences in the only line.

样例输入

10 3
1 2 3 4 3 2 1 1 2 2

样例输出

4

提示

来源

[提交][状态][讨论版]