• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            coreBugZJ

            此 blog 已棄。

            生成全排列的非回溯方法(TopCoder SRM 591 DIV 2)

            問題來自 TopCoder SRM 591 DIV 2 的第二題:

            Problem Statement
               
            Let X and Y be two strings of equal length, consisting of uppercase English letters only. The two strings are called convertible if there is a permutation P of the English alphabet with the following property: if each character c in the string X is replaced by the character P(c), we obtain the string Y. (In other words, X and Y are convertible iff the following holds: whenever two letters of X are equal, the corresponding two letters of Y must be equal, and vice versa.)  For example, consider the string "ABCA". We can choose to replace each 'A' by a 'F', each 'B' by a 'B', and each 'C' by a 'G', obtaining the string "FBGF". Thus the strings "ABCA" and "FBGF" are convertible. The strings "ABCA" and "EFGH" are not convertible, because the two 'A's in the first string must correspond to the same letter in the second string. The strings "ABCA" and "EEEE" are not convertible, because different letters in the first string must correspond to different letters in the second string.  You are given two strings A and B of the same length. These strings only contain English letters from 'A' to 'I', inclusive. (That is, only the first 9 letters of the alphabet are used.)  You want to change A and B into two strings that are convertible. The only allowed change is to choose some indices (possibly none) and to remove the characters at those indices from each of the strings. (I.e., the removed characters must be at the same positions in both strings. For example, it is not allowed to only remove character 0 of A and character 3 of B.) For example, if A="ABAC", B="AHHA" and the chosen indices are 0 and 2, then the resulting strings will be "BC" and "HA". Our goal is to choose as few indices as possible, given that after the erasing we want to obtain two convertible strings. Compute and return the smallest possible number of chosen indices.
            Definition
               
            Class:
            ConvertibleStrings
            Method:
            leastRemovals
            Parameters:
            string, string
            Returns:
            int
            Method signature:
            int leastRemovals(string A, string B)
            (be sure your method is public)
               

            Constraints
            -
            A will contain between 1 and 50 characters, inclusive.
            -
            A and B will be of the same length.
            -
            A will contain characters from 'A' to 'I' only.
            -
            B will contain characters from 'A' to 'I' only.

            我的思路是窮舉A中字母與B中字母的對應關系,看哪種對應需要刪除的字母最少,這一最少值即是答案。
            窮舉對應關系,就是生成全排列。
            我生成全排列的方式是回溯。

            之后看其他人的代碼,發現一個由給定排列求出其下一個排列的函數,于是學習一下,自己實現如下:

            // 生成下一字典序排列
            // 假設a中元素互不相同
            // 若已經是最后一個字典序排列,則返回0,否則返回1
            int next_permutation( int a[], int n ) {
                    
            int i, j;
                    
            for ( i = n-1; (0 < i) && (a[i-1> a[i]); --i ) {
                    }
                    
            if ( 0 >= i ) {
                            
            return 0;
                    }
                    
            for ( j = n-1; j >= i; --j ) {
                            
            if ( a[ j ] > a[ i-1 ] ) {
                                    
            int tmp = a[ i-1 ];
                                    a[ i
            -1 ] = a[ j ];
                                    a[ j ] 
            = tmp;
                                    j 
            = n - 1;
                                    
            while ( i < j ) {
                                            tmp 
            = a[ i ];
                                            a[ i ] 
            = a[ j ];
                                            a[ j ] 
            = tmp;
                                            
            ++i; --j;
                                    }
                                    
            break;
                            }
                    }
                    
            return 1;
            }

            還有人使用的是C++的 <algorithm> 中 next_permutation 函數,功能一樣。


            posted on 2013-09-28 17:03 coreBugZJ 閱讀(910) 評論(0)  編輯 收藏 引用 所屬分類: ACM 、Algorithm

            久久无码AV一区二区三区| 欧美午夜精品久久久久免费视| 国产精品毛片久久久久久久| 久久国产精品一区二区| 久久露脸国产精品| 欧美噜噜久久久XXX| 国产午夜福利精品久久| 久久久无码精品亚洲日韩京东传媒 | 亚洲精品成人网久久久久久| 18岁日韩内射颜射午夜久久成人| 国产亚洲色婷婷久久99精品| 国产福利电影一区二区三区久久老子无码午夜伦不 | 思思久久精品在热线热| 久久无码av三级| 国产精品久久久久蜜芽| 亚洲国产成人久久精品动漫| 伊人久久成人成综合网222| 国内精品久久久久影院日本| 无码任你躁久久久久久久| 日本免费久久久久久久网站| 伊人色综合久久天天人手人婷| 久久亚洲国产精品一区二区| 亚洲精品白浆高清久久久久久 | 国产精品久久久99| 久久91精品国产91久久麻豆| 国产偷久久久精品专区 | 日本高清无卡码一区二区久久 | 久久精品无码一区二区三区| 亚洲日本久久久午夜精品| 国产精品免费久久| 国产叼嘿久久精品久久| 久久九九全国免费| 精品久久一区二区| 色综合久久久久网| 久久免费精品视频| 国内精品久久国产大陆| 国产精品久久成人影院| 高清免费久久午夜精品| 久久久国产精品网站| 久久91精品国产91久久户| 亚洲国产精品久久久久久|