【HDU 4162】Shape Number(一阶差分链码+最小表示法)

最新推荐文章于 2020-04-03 09:49:22 发布

小胡子Haso

最新推荐文章于 2020-04-03 09:49:22 发布

阅读量2.8k

点赞数

分类专栏： ------------各种OJ------------ HDOJ ACM道路之数据结构

本文链接：https://blog.csdn.net/ChallengerRumble/article/details/48691947

版权

【HDU 4162】Shape Number(一阶差分链码+最小表示法)

Shape Number

Time Limit: 24000/12000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1249 Accepted Submission(s): 593

Problem 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 consec