hoj 1048 - Cipher

 http://acm.hit.edu.cn/ojs/show.php?Proid=1048&Contestid=0

先把题中的key转化为有向图。转化原则，对于图中的一条边V，i为V的起点，a_i为V的终点。然后求出图中的所有有向圈及相应的长度。（对于图中任意一点，要么在某个有向圈中，要么是孤立的一点。）以题中的测试数据为例

key：4 5 3 7 2 8 1 6 10 9

有向圈                         圈长

1->4->7->1                3

2->5->2                      2

3->3                            1

6->8->6                      2

9->10->9                    2

图中个点序号对应题中字符在加密语句中的位置，而加密k次相当于圈中每点在圈中向前移动k步。因此本题中加密语句中的每个位置的加密周期可能不一样，但在同一个有向圈的各位置的周期一定相同，那么只需分别对每个有向圈中的各位置求出加密后语句即可。

附代码

#include <iostream>
#include <cmath>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
 
using namespace std;
int main()
{
    int n, k, a[210], i, j, key[210][210], en[210], kn;
    int len, t;
    bool mark[210];
    char line[210], ans[210];
 
    while (scanf("%d", &n) == 1 && n != 0)
    {
        for (i = 0; i < n; i++)
        {
            scanf("%d", &a[i]);
        }
        memset(mark, 0, sizeof(mark));
        kn = 0;
        for (i = 0; i < n; i++)
        {
            if (mark[i] == true)
            {
                continue;
            }
            else if (a[i] == i + 1)
            {
                en[kn] = 1;
                key[kn++][0] = i;
                mark[i] = true;
            }
            else if (mark[i] == false)
            {
                en[kn] = 1;
                key[kn][0] = i;
                mark[i] = true;
                j = a[i] - 1;
                while (j != i)
                {
                    key[kn][en[kn]++] = j;
                    mark[j] = true;
                    j = a[j] - 1;
                }
                kn++;
            }
        }
 
        while (scanf("%d", &k) == 1 && k != 0)
        {
            getchar();
            gets(line);
            len = strlen(line);
            if (len < n)
            {
                for (i = len; i < n; i++)
                {
                    line[i] = ' ';
                }
                line[n] = '/0';
            }
 
            for (i = 0; i < kn; i++)
            {
                t = k % en[i];
                for (j = 0; j < en[i]; j++)
                {
                    ans[key[i][(j+t)%en[i]]] = line[key[i][j]];
                }
            }
            ans[n] = '/0';
            printf("%s/n", ans);
        }
        printf("/n");
    }
    return 0;
}