uva 146 ID Codes

ID Codes

It is 2084 and the year 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 into 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 allowable 60 codes under these conditions are:

      abaabc
      abaacb
      ababac

These three codes are listed from top to bottom in alphabetic 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 print 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 by 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

题目大意：生成所给字符串对应字典序的下一个。

解题思路：由字符串末尾开始遍历，1、当找到字符比当前字符小的时候，将当前字符到所匹配字符中间的所有字符放入缓存堆中（当前字符不需要放入），将缓存堆中的字符按照字典序的排列，接入字符串（注意接入点）。2、当当前字符为子串中最小的时候，将当前字符放入缓存堆。

注意：本题可用next_permutation().

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;

#define N 60

int n;
char str[N];

int find(char tem[])
{
	int k = 0;
	for(int i = n - 1; i >= 0; i--)
	{
		for(int j = i - 1; j >= 0; j--)
		{
			if(str[i] > str[j])
			{
				for(int f = i - 1; f >= j; f--)
					tem[k++] = str[f];
				return i;

			}
		}
		tem[k++] = str[i];
	}
	return -1;
}
int main()
{
	char tem[N];
	// Init.
	memset(str, 0, sizeof(str));

	while(cin >> str)
	{
		if(strcmp(str, "#") == 0)	
			break;

		n = strlen(str);
		memset(tem, 0, sizeof(tem));
		int m = find(tem);
		int k = strlen(tem);

		if(m == -1)
			cout << "No Successor" << endl;
		else
		{
			str[n - k -1] = str[m];
			sort(tem, tem + k);

			for(int i = 0; i < k; i++)
				str[n - k + i] = tem[i];

			cout << str << endl;
		}	
		memset(str, 0, sizeof(str));
	}
	return 0;}