HDU - 4550 卡片游戏

3
565
9876543210
9876105432

Sample Output

556
1234567890
1678905432

思路：贪心的从后向前开始，大的放后面，然后找到当前最小的，从后面来也可以排除0放到第一个的可能

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 200;

char str[MAXN];
char head[MAXN],tail[MAXN];

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%s", str);
		int n = strlen(str);
		int a = 0, b = 0;
		int cnt = n-1;
		while (str[cnt] == '0' && cnt > 0)
			cnt--;
		for (int i = cnt; i >= 0; i--) 
			if (str[cnt] > str[i] && str[i] != '0')
				cnt = i;
		head[a++] = str[cnt];
		for (int i = n-1; i > cnt; i--)
			tail[b++] = str[i];
		while (a+b < n && cnt > 0) {
			int tmp = cnt-1;
			for (int j = tmp-1; j >= 0; j--)
				if (str[j] < str[tmp])
					tmp = j;
			head[a++] = str[tmp];
			for (int j = cnt-1; j > tmp; j--)
				tail[b++] = str[j];
			cnt = tmp;
		}
		for (int i = 0; i < a; i++)
			printf("%c", head[i]);
		for (int j = b-1; j >= 0; j--)
			printf("%c", tail[j]);
		printf("\n");
	}
	return 0;
}

HDU - 4550 卡片游戏,布布扣,bubuko.com

HDU - 4550 卡片游戏

原文：http://blog.csdn.net/u011345136/article/details/36899929