uva 146 ID Codes

It is 2084 and the y ear of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, the Government decides on a radical measure|all citizens are to have a tiny microcomputer surgically implanted in their left wrists. This computer will contains all sorts of personal information as well as a transmitter which will allow people’s movements to be logged and monitored by a central computer. (A desirable side effect of this process is that it will shorten the dole queue for plastic surgeons.) An essential component of each computer will be a unique identification code, consisting of up to 50 characters drawn from the 26 lower case letters. The set of characters for any given code is chosen somewhat haphazardly . The complicated way in which the code is imprinted in to the chip makes it much easier for the manufacturer to produce codes which are rearrangements of other codes than to produce new codes with a different selection of letters. Thus, once a set of letters has been chosen all possible codes derivable from it are used before changing the set.
For example, suppose it is decided that a code will contain exactly 3 occurrences of ‘a’, 2 of ‘b’ and 1 of ‘c’, then three of the allow able 60 codes under these conditions are:
abaabc
abaacb
ababac
These three codes are listed from top to bottom in alphab etic order. Among all codes generated with this set of characters, these codes appear consecutively in this order. Write a program to assist in the issuing of these identification codes. Your program will accept a sequence of no more than 50 lower case letters (which may contain repeated characters) and prin t the successor code if one exists or the message ‘No Successor’ if the given code is the last in the sequence for that set of characters.
Input and Output
Input will consist of a series of lines each containing a string representing a code. The entire file will be terminated b y a line consisting of a single #.
Output will consist of one line for each code read containing the successor code or the words `No
Successor’ .
Sample input
abaacb
cbbaa
#
Sample output
ababac
No Successor

中文：
给你一个字符串，长度不超过50，让你找按照字典序的下一个排列。如果是最后一个排列，那么输出
No Successor

#include <bits/stdc++.h>
using namespace std;
string s;
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>s)
    {
        if(s=="#")
            break;
        int i=-1,h=-1;
        for(int j=1;j<s.size();j++)
        {
            if(s[j]>s[j-1])
                i=j;
        }
        if(i==-1)
        {
            cout<<"No Successor"<<endl;
            continue;
        }
        for(int k=1;k<s.size();k++)
        {
            if(s[k]>s[i-1])
                h=k;
        }
        swap(s[i-1],s[h]);
        reverse(s.begin()+i,s.end());
        cout<<s<<endl;
    }
    return 0;
}

解答：
好久没做题了，最近正在学组合数学。讲到生成排列的方法，正好看到这道题，就顺手做了。
使用字典序法生成排列。
算法: 由 P1P2…Pn 生成的下一个排列的算法如下:
1. 求 i=max{j| Pj-1
2. 求 l=max{k| Pi-1
3. 交换Pi-1 与Pl得到P1P2…Pi-1 (P i….Pn ) , 将红色部分顺序逆转,得到结果.

当然，也可以用c++ stl里面的next_permutation，更加简单粗暴

#include <bits/stdc++.h>
using namespace std;
string s;
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>s)
    {
        if(s=="#")
            break;
        if(next_permutation(s.begin(),s.end()))
            cout<<s<<endl;
        else
            cout<<"No Successor"<<endl;
    }
    return 0;
}