POJ 1699 Best Sequence (DFS + preprocessing)

POJ 1699 Best Sequence (DFS + preprocessing)

Question: Let's see the figure clearly. N sequences are connected first (the same sequence part) to obtain the Shortest total sequence.

 

The idea is to rough the length that can be overlapped at the beginning and end of N sequences. DFS then enumerates each type of connection at the beginning and end.

 

 

# Include

 
  
# Include

  
   
# Include # define N 22 # define INF 0x7fffffusing namespace std; int n, ans; int f [N] [N], vis [N], len [N]; char str [N] [N]; void get (int x, int y) // f [x] [y], maximum Repeated length that can be reduced after applying y to x {int I, j, l; for (l = len [y]; l> 0; l --) // enumeration length {int OK = 1; for (I = len [x]-l, j = 0; I

   
    
Ans) // pruning ~ Return; for (int I = 0; I