hdu.5202.Rikka with string(贪心）

Rikka with string

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 581    Accepted Submission(s): 227

Problem Description

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:


One day, Yuta got a string which contains n letters but Rikka lost it in accident. Now they want to recover the string. Yuta remembers that the string only contains lowercase letters and it is not a palindrome string. Unfortunately he cannot remember some letters. Can you help him recover the string?


It is too difficult for Rikka. Can you help her?

 

Input

This problem has multi test cases (no more than 20). For each test case, The first line contains a number n(1≤n≤1000). The next line contains an n-length string which only contains lowercase letters and ‘?’ – the place which Yuta is not sure.

 

Output

For each test cases print a n-length string – the string you come up with. In the case where more than one string exists, print the lexicographically first one. In the case where no such string exists, output “QwQ”.

 

Sample Input

5 a?bb? 3 aaa

 

Sample Output

aabba QwQ

 

Source

BestCoder Round #37 ($)

 

#include<stdio.h>
#include<string.h>
int cnt = 0 ;
char st[1000 + 10] ;
char rst [1000 + 10] ;
int n , vis[1000 + 10];

void rev (char s[1000 + 10])
{
    char tmp[1000 + 10] ;
    int k = 0 , i ;
    for (i = strlen (st) - 1 ; i >= 0 ; i-- , k ++) {
        tmp[k] = st[i] ;
    }
    tmp[k] = '' ;
    strcpy (s , tmp) ;
}

int main ()
{
   // freopen ("a.txt" , "r" , stdin ) ;
    while (~ scanf ("%d" , &n)) {
        getchar () ;
        gets (st) ;
        cnt = 0 ;
        for (int i = 0 ; st[i] != '' ;i ++) {
            if (st[i] == '?') {
                vis[cnt ++] = i ;
                st[i] = 'a' ;
            }
        }
        int i ;
        rev (rst) ;
        if (strcmp (st , rst)== 0) {
            for (i = cnt - 1 ; i >= 0 ; i--) {
                st[vis[i]] = 'b' ;
                rev (rst) ;
                if (strcmp (rst , st)!= 0) {
                    break ;
                }
                st[vis[i]] = 'a' ;
            }
            if (i == -1 ) puts ("QwQ") ;
            else puts (st) ;
        }
        else puts (st) ;
    }
    return 0 ;
}

如果没有不是回文串的限制可以把所有的?都变成a，这样一定是字典序最小的。而现在有了回文串的限制，我们可以从小到大枚举最靠后的不在字符串正中心的问号选什么，其他的问号依然换成a，显然如果有解，这样一定可以得到字典序最小的解。注意特判没有问号以及问号在正中心的情况。
时间复杂度O(n)