【HDOJ】1031 Design T-Shirt

qsort直接排序。

 #include <stdio.h>
 #include <string.h>
 #include <stdlib.h>

 #define MAXNUM 1000

 typedef struct {
     int index;
     double statis;
 } node_st;

 node_st nodes[MAXNUM];

 int comp1(const void *a, const void *b) {
     node_st *p = (node_st *)a;
     node_st *q = (node_st *)b;

     if (p->statis == q->statis)
         return p->index - q->index;
     else
         return (q->statis>p->statis) ? :-;
 }

 int comp2(const void *a, const void *b) {
     node_st *p = (node_st *)a;
     node_st *q = (node_st *)b;

     return q->index - p->index;
 }

 void output(int m) {
     int i;
     for (i=; i<=m; ++i)
         printf("index=%d, statis:%lf\n", nodes[i].index, nodes[i].statis);
 }

 int main() {
     int n, m, k;
     int i;
     double tmp;

     while (scanf("%d %d %d", &n, &m, &k) != EOF) {
         memset(nodes, , sizeof(nodes));
         while (n--) {
             for (i=; i<=m; ++i) {
                 scanf("%lf", &tmp);
                 nodes[i].statis += tmp;
             }
         }
         for (i=; i<=m; ++i)
             nodes[i].index = i;
         qsort(nodes+, m, sizeof(node_st), comp1);
         //output(m);
         qsort(nodes+, k, sizeof(node_st), comp2);
         //output(k);
         for (i=; i<=k; ++i) {
             if (i == )
                 printf("%d", nodes[i].index);
             else
                 printf(" %d", nodes[i].index);;
         }
         printf("\n");
     }

     return ;
 }

01背包也可解。

 #include <stdio.h>
 #include <string.h>

 #define MAXNUM 1000

 double dp[MAXNUM];
 double statis[MAXNUM];
 char visit[MAXNUM][MAXNUM];

 double max(double a, double b) {
     return a>b ? a:b;
 }

 int main() {
     int n, m, k;
     int i, j, p;
     double tmp;

     while (scanf("%d%d%d",&n,&m,&k) != EOF) {
         memset(dp, , sizeof(dp));
         memset(statis, , sizeof(statis));
         memset(visit, , sizeof(visit));

         while (n--) {
             for (i=; i<=m; ++i) {
                 scanf("%lf", &tmp);
                 statis[i] += tmp;
             }
         }

         for (i=; i<=m; ++i) {
             for (j=k; j>; --j) {
                 tmp = dp[j-] + statis[i];
                 if (dp[j] < tmp) {
                     dp[j] = tmp;
                     for (p=; p<i; ++p)
                         visit[j][p] = visit[j-][p];
                     visit[j][i] = ;
                 }
             }
         }
         i = ;
         for (p=m; p>; --p) {
             if (visit[k][p]) {
                 if (i)
                     printf(" %d", p);
                 else
                     printf("%d", p);
                 ++i;
             }
         }
         printf("\n");
     }

     return ;
 }