UVA11849 HDU3763 CD【合并有序序列】

Jack and Jill have decided to sell some of their Compact Discs, while they still have some value. They have decided to sell one of each of the CD titles that they both own. How many CDs can Jack and Jill sell?
    Neither Jack nor Jill owns more than one copy of each CD.
Input
The input consists of a sequence of test cases. The first line of each test case contains two non-negative integers N and M, each at most one million, specifying the number of CDs owned by Jack and by Jill, respectively. This line is followed by N lines listing the catalog numbers of the CDs owned by Jack in increasing order, and M more lines listing the catalog numbers of the CDs owned by Jill in increasing order. Each catalog number is a positive integer no greater than one billion. The input is terminated by a line containing two zeros. This last line is not a test case and should not be processed.
Output
For each test case, output a line containing one integer, the number of CDs that Jack and Jill both own.
Sample Input
3 3
1
2
3
1
2
4
0 0
Sample Output
2

问题链接：UVA11849 HDU3763 CD
问题简述：（略）
问题分析：
    给定2个有序序列，求2个序列的相同元素个数。
    合并2个有序序列即可，使用2个指针（下标）进行合并处理。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA11849 HDU3763 CD */

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6;
int jack[N], jill[N];

int main()
{
    int n, m;
    while(~scanf("%d%d", &n, &m) && (n || m)) {
        for(int i = 0; i < n; i++)
            scanf("%d", &jack[i]);
        for(int i = 0; i < m; i++)
            scanf("%d", &jill[i]);

        int p = 0, q = 0, cnt = 0;
        while(p < n && q < m)
            if(jack[p] == jill[q]) cnt++, p++, q++;
            else if(jack[p] < jill[q]) p++;
            else /* if(jack[p] > jill[q]) */ q++;

        printf("%d\n", cnt);
    }

    return 0;
}