HDU3460-Ancient Printer

Ancient Printer

                                                                             Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
                                                                                                        Total Submission(s): 1791    Accepted Submission(s): 880

Problem Description

The contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper.
Unfortunately, what iSea could find was only an ancient printer: so ancient that you can't believe it, it only had three kinds of operations:

● 'a'-'z': twenty-six letters you can type
● 'Del': delete the last letter if it exists
● 'Print': print the word you have typed in the printer

The printer was empty in the beginning, iSea must use the three operations to print all the teams' name, not necessarily in the order in the input. Each time, he can type letters at the end of printer, or delete the last letter, or print the current word. After printing, the letters are stilling in the printer, you may delete some letters to print the next one, but you needn't delete the last word's letters.
iSea wanted to minimize the total number of operations, help him, please.

 

Input

There are several test cases in the input.

Each test case begin with one integer N (1 ≤ N ≤ 10000), indicating the number of team names.
Then N strings follow, each string only contains lowercases, not empty, and its length is no more than 50.

The input terminates by end of file marker.

 

Output

For each test case, output one integer, indicating minimum number of operations.

 

Sample Input

  
  

   
   2
freeradiant
freeopen
  
  

 

Sample Output

  
  

   
   21

   
   

    
    

     
     Hint
    
    
The sample's operation is:
f-r-e-e-o-p-e-n-Print-Del-Del-Del-Del-r-a-d-i-a-n-t-Print
   
   
   
    
  
  

 

Author

iSea @ WHU

 

Source

2010 ACM-ICPC Multi-University Training Contest（3）——Host by WHU

题意:有三种操作,为删除一个字符,输出一个字符串,输入一个字符,给你n个字符串,求最少的操作能够输出所有的单词

解题思路：要形成一个新的单词,一定是现在的单词删除字符到和新的单词具有相同的根的地方,所以长度最大的单词一定是最后进行操作的。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>

using namespace std;

string x[10005];

int f(string a,string b)
{
    int i;
    for(i=0;i<a.size()&&i<b.size()&&a[i]==b[i];i++)
        ;
    return a.size()-i+b.size()-i;
}

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
            cin>>x[i];
        sort(x,x+n);
        int sum=x[0].size()+1;
        int ma=x[0].size();
        for(int i=1;i<n;i++)
        {
            sum+=f(x[i],x[i-1])+1;
            if(x[i].size()>ma)
                ma=x[i].size();
        }
        printf("%d\n",sum-ma+x[n-1].size());
    }
    return 0;
}