*the cow lineup<pku 1989>

View Code

1 /* [(1...n) (1...n)] */
2 #include < iostream >
3 #include < cstring >
4 #include < vector >
5 using namespace std;
6 int vis[ 10005 ] ,f[ 100005 ];
7 int main()
8 {
9 int n,m;
10 cin >> n >> m;
11 for ( int i = 0 ;i < n;i ++ ) cin >> f[i] ;
12 int ans = 0 ;
13 memset(vis, 0 , sizeof (vis));
14 for ( int i = 0 ,t = 0 ;i < n;i ++ )
15 {
16 if (vis[f[i]] == 0 )
17 {
18 t ++ ;
19 vis[f[i]] = 1 ;
20 }
21 if (t == m)
22 {
23 ans ++ ;
24 t = 0 ;
25 memset(vis, 0 , sizeof (vis));
26 }
27 }
28 cout << ans + 1 << endl;
29 return 0 ;
30 }

转载于:https://www.cnblogs.com/eth0/archive/2011/04/27/2030817.html