zoukankan      html  css  js  c++  java
  • (HDOJ 1031)Design TShirt

    Design T-Shirt


    Problem Description
    Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACM-ICPC logo, big names in computer science, well-known graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized.
     

    Input
    The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The j-th number in the i-th line represents the i-th person's satisfaction on the j-th element.
     

    Output
    For each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line.
     

    Sample Input
    3 6 4

    2 2.5 5 1 3 4 

    5 1 3.5 2 2 2 

    1 1 1 1 1 10 

    3 3 2 

    1 2 3 

    2 3 1 

    3 1 2

     

    Sample Output
    6 5 3 1

    2 1

     
     Sample code:

     #include<stdio.h>

    #include<string.h>
    #include
    <ctype.h>

    double a[1000][1000];
    int main()
    {
         
    int n,m,k,i,j,sum,c[1000],t,x;
         
    double max,b[1000];
         
    while(scanf("%d %d %d",&n,&m,&k)!=EOF)
         {
              sum
    =0; x=0;
              memset(b,
    0,sizeof(b));
              memset(c,
    0,sizeof(c));
              
    for(i=1; i<=n; i++)
              {
                   
    for(j=1; j<=m; j++)
                   {
                        scanf(
    "%lf",&a[i][j]);
                        b[j]
    +=a[i][j];
                      }
                 }
                 
    while(sum<k)
                 {
                      max
    =-1;
                      
    for(i=1; i<=m; i++)
                      {
                           
    if(b[i]>max)
                           {
                                max
    =b[i];
                                t
    =i;
                              }
                         }
                         b[t]
    =-1;
                         c[t]
    =1;
                         sum
    ++;
                    }
                    
    for(i=m; i>=1; i--)
                    {
                         
    if(c[i]==1)
                         {
                              x
    ++;
                              
    if(x==k)
                              {
                                   printf(
    "%d\n",i);
                                   
    break;
                                 }
                                 
    else
                                 {printf(
    "%d ",i);}
                            }
                    }
            }
         
    return 0;
    } 

  • 相关阅读:
    java 虚拟机启动参数[转]
    Android SDK Manager 无法下载更新,或者更新速度超慢,或者待安装包列表不显示
    fluentnhibernet auto mapping
    取消sqlserver 锁表
    TFS 2010 配置的时候,提示TF255466错误
    doc中文乱码的解决方法 中英文切换
    silverlight 读取wcf服务 读取宿主端的config 良好的方法
    dojo+js+html5学习网址
    win 7 64位 配置silverlight 32位的应用程序(sl网站)
    HTTP协议及其POST与GET操作差异 & C#中如何使用POST、GET等
  • 原文地址:https://www.cnblogs.com/cpoint/p/2063482.html
Copyright © 2011-2022 走看看