POJ 1854 贪心(分治）

Evil Straw Warts Live

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 1144		Accepted: 330

Description

A palindrome is a string of symbols that is equal to itself when reversed. Given an input string, not necessarily a palindrome, compute the number of swaps necessary to transform the string into a palindrome. By swap we mean reversing the order of two adjacent symbols. For example, the string "mamad" may be transformed into the palindrome "madam" with 3 swaps: 
swap "ad" to yield "mamda" 
swap "md" to yield "madma" 
swap "ma" to yield "madam" 

Input

The first line of input gives n, the number of test cases. For each test case, one line of input follows, containing a string of up to 8000 lowercase letters.

Output

Output consists of one line per test case. This line will contain the number of swaps, or "Impossible" if it is not possible to transform the input to a palindrome. 

Sample Input

3
mamad
asflkj
aabb

Sample Output

3
Impossible
2

Source

Waterloo local 2004.09.19

题意：给你一个字符串，求最少交换相邻字符多少次能将它变为回文串。

思路：先处理两边的，然后删掉，递归操作。

代码：

 #include"cstdio"
 #include"map"
 #include"set"
 #include"cmath"
 #include"queue"
 #include"vector"
 #include"string"
 #include"cstring"
 #include"ctime"
 #include"iostream"
 #include"cstdlib"
 #include"algorithm"
 #define db double
 #define ll long long
 #define vec vector<ll>
 #define mt  vector<vec>
 #define ci(x) scanf("%d",&x)
 #define cd(x) scanf("%lf",&x)
 #define cl(x) scanf("%lld",&x)
 #define pi(x) printf("%d\n",x)
 #define pd(x) printf("%f\n",x)
 #define pl(x) printf("%lld\n",x)
 //#define rep(i, x, y) for(int i=x;i<=y;i++)
 #define rep(i, n) for(int i=0;i<n;i++)
 const int N   = 1e6 + ;
 const int mod = 1e9 + ;
 const int MOD = mod - ;
 const int inf = 0x3f3f3f3f;
 const db  PI  = acos(-1.0);
 const db  eps = 1e-;
 using namespace std;
 int ans;
 int c[];
 char s[];
 void swap(char &e,char &f){
     char ch;
     ch=e,e=f,f=ch;
 }
 int dfs(int l,int r)
 {
     if(l>=r) return ans;
     int lp=N,rp=-N;
     for(int i=l;i<r;i++){//移动字符到左边与右边配对
         if(s[i]==s[r]){
             lp=i;
             break;
         }
     }
     for(int i=r;i>l;i--){//移动字符到右边与左边配对
         if(s[i]==s[l]){
             rp=i;
             break;
         }
     }
     if(lp-l<=r-rp){
         ans+=lp-l;
         for(int i=lp;i>l;i--) swap(s[i],s[i-]);
     }
     else{
         ans+=r-rp;
         for(int i=rp;i<r;i++) swap(s[i],s[i+]);
     }
     return dfs(l+,r-);
 }
 int main()
 {
     int n;
     ci(n);
     while(n--)
     {
         cin>>s;
         memset(c,, sizeof(c));
         int len=strlen(s);
         for(int i=;s[i];i++) c[s[i]-'a']++;
         int ok=;
         for(int i=;i<;i++) if(c[i]&) ok++;
         ans=;
         if(ok>) puts("Impossible");
         else pi(dfs(,len-));
     }
 }