Codeforces Round #120 (Div. 2) / 190D Non-Secret Cypher (计数&two pointers)

http://codeforces.com/contest/190/problem/D

【神题必有神解】

从这一题可大题了解two pointers算法的威力。

/*560ms,14300KB*/

#include<bits/stdc++.h>
using namespace std;
const int mx = 400005;

int a[mx];
map<int, int> mp;

/*数据例子：
10 2
2 3 4 1 5 6 7 1 2 3
对于这个例子do-while只会在第二个1那里执行
统计了
2341...123,2341...12,2341...1;
341...123,341...12,341..1.;
41...123,41...12,41...1;
1...123,...12,...1
共12个
*/

int main()
{
	int n, k, i = 0, j; /// two pointers
	long long cnt = 0;
	scanf("%d%d%d", &n, &k, &a[0]);
	for (int j = 0; j < n; scanf("%d", &a[++j])) ///由于只有一组数据，所以可以这么读
		if (++mp[a[j]] >= k)
			do cnt += n - j, --mp[a[i]];
			while (a[i++] != a[j]);
	printf("%I64d", cnt);
	return 0;
}