HDU NO.4162 Shape Number(最小表示法循环输出字符串)

本文介绍了一种用于计算机视觉中形状归一化的算法。该算法通过计算链码的第一差分并找到循环输出的最小表示来确定形状的唯一编号。文章提供了实现这一算法的C++代码示例。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Description

In computer vision, a chain code is a sequence of numbers representing directions when following the contour of an object. For example, the following figure shows the contour represented by the chain code 22234446466001207560 (starting at the upper-left corner). 

Two chain codes may represent the same shape if the shape has been rotated, or if a different starting point is chosen for the contour. To normalize the code for rotation, we can compute the first difference of the chain code instead. The first difference is obtained by counting the number of direction changes in counterclockwise direction between consecutive elements in the chain code (the last element is consecutive with the first one). In the above code, the first difference is 

00110026202011676122 
Finally, to normalize for the starting point, we consider all cyclic rotations of the first difference and choose among them the lexicographically smallest such code. The resulting code is called the shape number. 
00110026202011676122 
01100262020116761220 
11002620201167612200 
... 
20011002620201167612 
In this case, 00110026202011676122 is the shape number of the shape above.
 

Input

The input consists of a number of cases. The input of each case is given in one line, consisting of a chain code of a shape. The length of the chain code is at most 300,000, and all digits in the code are between 0 and 7 inclusive. The contour may intersect itself and needs not trace back to the starting point.
 

Output

For each case, print the resulting shape number after the normalizations discussed above are performed.
 

Sample Input

22234446466001207560 12075602223444646600
 

Sample Output

00110026202011676122 00110026202011676122
 

题意&思路:

给出一个字符串(设想连成一个环)先按照相邻两个元素相减构成一个新的字符串,

然后利用最小表示法函数,找到循环输出的位置继而循环输出即可。

代码:

#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#define a first
#define b second
using namespace std;

const int MAX = 300000 + 5;
char s[MAX];

int func(char *s, int l){
    int i,j,k;
    i=0;
    j=1;
    k=0;
    while(i<l&&j<l){
        k=0;
        while(s[i+k]==s[j+k]&&k<l)
            k++;
        if(k==l)
            return i;
        if(s[i+k]>s[j+k])
            if(i+k+1>j) i=i+k+1;
                else i=j+1;
        else if(j+k+1>i) j=j+k+1;
                else  j=i+1;
    }
    if(i<l) return i;
    else return j;
}

int main(){
    while(~scanf("%s", s)){
        int len = strlen(s);
        char temp = s[0];
        char s1[MAX];
        for(int i = 0; i < len - 1; i++){
            s1[i] = ((s[i+1] - s[i] + 8) % 8) + '0';
        }
        s1[len-1] = ((temp - s[len-1] + 8) % 8) + '0';
        s1[len] = '\0';
        int p = func(s1, len);
        for(int i = 0, j = p; i < len; i++, j = (j + 1) % len){
            printf("%c", s1[j]);
        }
        printf("\n");
    }
    return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值