zoukankan      html  css  js  c++  java
  • POJ1789

    Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a truck. The code is simply a string of exactly seven lowercase letters (each letter on each position has a very special meaning but that is unimportant for this task). At the beginning of company's history, just a single truck type was used but later other types were derived from it, then from the new types another types were derived, and so on. 

    Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not derived from any other type). The quality of a derivation plan was then defined as 
    1/Σ(to,td)d(to,td)

    where the sum goes over all pairs of types in the derivation plan such that to is the original type and td the type derived from it and d(to,td) is the distance of the types. 
    Since historians failed, you are to write a program to help them. Given the codes of truck types, your program should find the highest possible quality of a derivation plan. 

    Input

    The input consists of several test cases. Each test case begins with a line containing the number of truck types, N, 2 <= N <= 2 000. Each of the following N lines of input contains one truck type code (a string of seven lowercase letters). You may assume that the codes uniquely describe the trucks, i.e., no two of these N lines are the same. The input is terminated with zero at the place of number of truck types.

    Output

    For each test case, your program should output the text "The highest possible quality is 1/Q.", where 1/Q is the quality of the best derivation plan.

    Sample Input

    4
    aaaaaaa
    baaaaaa
    abaaaaa
    aabaaaa
    0
    

    Sample Output

    The highest possible quality is 1/3.




    #include<cstring> #include<stdio.h> #include<algorithm> #include<string.h> #include<iostream> #include<iomanip> #include<stdlib.h> using namespace std; int i,j,k; #define PI 0x3f3f3f3f int N[2100][2100]; int s[3000]; char a[2002][8]; int fun(char *s1,char *s2) { int x=0; for(i=0; i<7; i++) if(s1[i]!=s2[i])x++; return x; } int main() { int n; while( scanf("%d",&n)!=EOF) { if(n==0)break; int i,j,k=0; memset(N,0,sizeof(N)); for(i=0; i<n; i++) { scanf("%s",a[i]); } for(i=0; i<n; i++) { for(j=0; j<n; j++) { N[i][j]=fun(a[i],a[j]); } } int dis=0,xiao=PI; int low[2001],quan[2001]; memset(low,1,sizeof(low)); low[0]=0; for(i=0; i<n; i++) quan[i]=N[0][i]; for(i=1; i<n; i++) { j=1; xiao=PI; k=0; while(j<n) { if(low[j]&&quan[j]<xiao) { k=j; xiao=quan[j]; } j++; } dis+=xiao; low[k]=0; for(j=1; j<n; j++) { if(low[j]&&N[k][j]<quan[j]) quan[j]=N[k][j]; } } printf("The highest possible quality is 1/%d. ",dis); } }
  • 相关阅读:
    PHP 获取某年第几周的开始日期和结束日期的实例
    PHP科学计数法转换成数字
    laravel 辅助函数
    laravel5.3之后可以使用withCount()这个方法
    laravel 5.1 Model 属性详解
    laravel的启动过程解析
    转:按需加载html 图片 css js
    移动平台WEB前端开发技巧汇总(转)
    php重定向页面的三种方式
    zepto API参考(~~比较全面)
  • 原文地址:https://www.cnblogs.com/woyaocheng/p/4844730.html
Copyright © 2011-2022 走看看