【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) ? 1:-1;
}

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=1; i<=m; ++i)
        printf("index=%d, statis:%lf
", 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, 0, sizeof(nodes));
        while (n--) {
            for (i=1; i<=m; ++i) {
                scanf("%lf", &tmp);
                nodes[i].statis += tmp;
            }
        }
        for (i=1; i<=m; ++i)
            nodes[i].index = i;
        qsort(nodes+1, m, sizeof(node_st), comp1);
        //output(m);
        qsort(nodes+1, k, sizeof(node_st), comp2);
        //output(k);
        for (i=1; i<=k; ++i) {
            if (i == 1)
                printf("%d", nodes[i].index);
            else
                printf(" %d", nodes[i].index);;
        }
        printf("
");
    }

    return 0;
}

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, 0, sizeof(dp));
        memset(statis, 0, sizeof(statis));
        memset(visit, 0, sizeof(visit));

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

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

    return 0;
}