poj 3464(Trie)Approximations

Approximations

Time Limit: 2000MS		Memory Limit: 131072K
Total Submissions: 419		Accepted: 23

Description

For any decimal fraction, we can obtain a set of approximations of different accuracy by mean of rounding. Take 0.2503 for example, we have the following approximations:

• 0.2503
• 0.250
• 0.25
• 0.3
• 0.

If two fractions A and B can both be rounded to C, we call C a common approximation of A and B. Two fractions may have more than one common approximations, each having a distinct accuracy. For example, 0.2503 and 0.2504 have common approximations 0.250 and 0.25. The accuracy of the former is 10⁻³, while that of the latter is 10⁻². Among all common approximations of two fractions, there is one that has the highest accuracy, and we call it the most accurate common approximation (MACA) of the two fractions. By this definition, the MACA of 0.2503 and 0.2504 is 0.250.

Given N fractions A_i (1 ≤ i ≤ N) in the range [0, 0.5), find a fraction x that maximizes the sum of −log₁₀ (the accuracy of the MACA of A_i and x). Report that maximized sum.

Input

The first line contains one integer N. N ≤ 100000.
Each of the next N lines contains a decimal fraction A_i. The total number of digits of the N decimal fractions doesn't exceed 400000. There is always a radix point, so zero is "0." instead of "0".

Output

One integer, the maximized sum.

Sample Input

4
0.250
0.2506
0.25115
0.2597

Sample Output

11

Hint

x = 0.25115.

Source

POJ Monthly--2007.11.25, Yang Yi

---

 

董华星在他09年的论文里说可以用字典树写。。我试着写了下，然而感觉题目是不是给的范围有问题啊。测了好多样例没问题。欢迎各位大佬给个样例测测0 0。

代码如下：

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #define clr(x) memset(x,0,sizeof(x))
 #define clr_1(x) memset(x,-1,sizeof(x))
 #define LL long long
 #define mod 1000000007
 #define INF 0x3f3f3f3f
 #define next nexted
 using namespace std;
 const int N=1e5+;
 const int M=4e5+;
 int next[M][];
 int num[M];
 char s[M];
 int n,m,k;
 int root,ttot;
 void tadd(char *s,int root)
 {
     int now=root,p;
     int len=strlen(s);
     for(int i=;i<len;i++)
     {
         p=s[i]-'';
         if(next[now][p]==)
         {
             next[now][p]=++ttot;
         }
         now=next[now][p];
         num[now]++;
     }
     return ;
 }
 int ans,prenode;
 void dfs(int now,int prenum)
 {
     int nownum,p;
     for(int i=;i<;i++)
     {
         nownum=prenum;
         p=next[now][i];
         if(i==)
         {
             if(prenode!=)
             {
                 prenode=next[prenode][];
                 if(prenode!=)
                 {
                     for(int j=;j<;j++)
                         if(next[prenode][j]!=)
                             nownum+=num[next[prenode][j]];
                 }
             }
         }
         else
         {
             if(next[now][i-]!=)
                for(int j=;j<;j++)
                 {
                     if(next[next[now][i-]][j]!=)
                     {
                         nownum+=num[next[next[now][i-]][j]];
                         if(i->=)
                         {
                             nownum+=num[next[next[now][i-]][j]];
                         }
                     }

                 }
         }
         if(i!=)
         {
             prenode=next[now][i-];
         }
         if(p!=)
         {
             nownum+=num[p];
             for(int j=;j<;j++)
             {
                 if(next[p][j]!=)
                 {
                     nownum-=num[next[p][j]];
                 }
             }
             if(i>=)
                 nownum+=num[p];
             if(nownum>ans)
                 ans=nownum;
 //            cout<<i<<" "<<nownum<<endl;
             dfs(p,nownum);
         }
         else
         {
             if(nownum>ans)
                 ans=nownum;
         }
     }
     return ;
 }
 int main()
 {
     scanf("%d",&n);
     ttot=root=;
     for(int i=;i<=n;i++)
     {
         scanf("%s",s);
         tadd(s+,root);
     }
     ans=;
     dfs(root,);
     printf("%d\n",ans);
     return ;
 }