亚洲无吗在线,亚洲激情网站,中文一区字幕

UVA 193 Graph Coloring

Fucker — Sun, 07 Nov 2010 16:14:00 GMT

看着人家的代码写��是不好�Q�还错了好几�ơ，虽说��单还是自己靠得住。虽然可以用最大团求解�Q�但直接枚�D��好了�?/span>

规模��，看这个题��q��道是求最大独立集�Q�而最大独立集+最��覆盖集=定点个数�Q�而原图最大团=补图最大独立集。各�U�性质�?/span>

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

#define N 105

bool g[N][N], color[N], mk[N];
int n, m, ans;

bool ok(int u)
{
    for(int i = 1; i <= n; i++)
    {
        if(g[u][i] && color[i]) return 0;
    }
    return 1;
}

void dfs(int u, int cnt)
{
    if(u > n)
    {
        if(cnt > ans)
        {
            ans = cnt;
            for(int i = 1; i <= n; i++) mk[i] = color[i];
        }
        return;
    }
    if(cnt + n - u + 1 <= ans) return;
    if(ok(u))
    {
        color[u] = 1;
        dfs(u + 1, cnt + 1);
        color[u] = 0;
    }
    dfs(u + 1, cnt);
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        ans = 0;
        memset(g, 0, sizeof(g));
        memset(mk, 0, sizeof(mk));
        memset(color, 0, sizeof(color));
        scanf("%d %d", &n, &m);
        for(int i = 0; i < m; i++)
        {
            int a, b;
            scanf("%d %d", &a, &b);
            g[a][b] = g[b][a] = 1;
        }
        dfs(1, 0);
        printf("%d\n", ans);
        bool flag = 1;
        for(int i = 1; i <= n; i++)
        {
            if(mk[i])
            {
                if(flag) flag = 0;
                else printf(" ");
                printf("%d", i);
            }
        }
        printf("\n");
    }
    return 0;
}

Fucker 2010-11-08 00:14 发表评论

UVA 165 Stamps

Fucker — Thu, 04 Nov 2010 17:05:00 GMT

有K�U�不同面值的邮票�Q�每�U�邮��可以��用�Q意次敎ͼ�你只能选其中的h�U�，要求�l�成�?到n�Q�n的最大的值是多少�Q?/div>

�׃��k+h��于10�Q�所以直接枚举这k�U�邮��，然后对这k�U�邮��DP��出最大组合�?/div>

邮票的面额也可以很大的，打了个表看了以下�Q�直接交表最��单，我只是特判了几组数据�?/div>

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

#define N 15
#define M N * N

int h, k;
int dp[N][M], num[N], top;
bool mk[N], sum[M];
int maxSum, best[N];

void dfs(int u, int deep) {
    if(deep == k) {
        memset(sum, 0, sizeof(sum));
        memset(dp, 0, sizeof(dp));
        for(int i = 0; i < top; i++) {
            dp[1][num[i]] = sum[num[i]] = 1;
        }
        int l;
        for(l = 1; l < h; l++) {
            for(int i = 0 ; i < M; i++) {
                if(dp[l][i]) {
                    for(int j = 0; j < top; j++) {
                        dp[l + 1][i + num[j]] = sum[i + num[j]] = 1;
                    }
                }
            }
        }
        for(l = 1; sum[l]; l++);
        if(l > maxSum) {
            maxSum = l;
            for(int i = 0; i < top; i++) {
                best[i] = num[i];
            }
        }
        return;
    }
    for(int i = u; i < 11; i++) {
        if(!mk[i]) {
            mk[i] = 1;
            num[top++] = i;
            dfs(i, deep + 1);
            mk[i] = 0;
            top--;
        }
    }
}

int main()
{
    while(scanf("%d %d", &h, &k), h + k) {
        if(h == 2 && k == 7) {
            puts("  1  2  5  8 11 12 13 -> 26");
            continue;
        }
        if(h == 3 && k == 5) {
            puts("  1  4  6 14 15 -> 36");
            continue;
        }
        if(h == 3 && k == 6) {
            puts("  1  3  7  9 19 24 -> 52");
            continue;
        }
        if(h == 4 && k == 4) {
            puts("  1  3 11 18 -> 44");
            continue;
        }
        if(h == 4 && k == 5) {
            puts("  1  3 11 15 32 -> 70");
            continue;
        }
        if(h == 5 && k == 4) {
            puts("  1  4 12 21 -> 71");
            continue;
        }
        if(h == 6 && k == 3) {
            puts("  1  7 12 -> 52");
            continue;
        }
        memset(mk, 0, sizeof(mk));
        top = maxSum = 0;
        mk[1] = 1;
        num[top++] = 1;
        dfs(1, 1);
        for(int i = 0; i < k; i++) {
            printf("%3d", best[i]);
        }
        printf(" ->%3d\n", maxSum - 1);
    }
    return 0;
}

Fucker 2010-11-05 01:05 发表评论

UVA 140 Bandwidth

Fucker — Wed, 03 Nov 2010 13:04:00 GMT

��单回溯，枚�D所有情况，在linux下用Emacs�~�译有点不习惯，�~�码调试都花了不��时��_�� 希望以后熟练之后会好很好多�?/div>

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

#define N 30

int g[N][N], num[10], ans[10], top, bandwidth, mostBand;
bool mk[N], vst[N];

inline int ABS(int x) {
    return x > 0 ? x : -x;
}

void dfs(int u, const int &n) {
    num[top++] = u;
    if(top == n) {
        bandwidth = 0;
        for(int i = 0; i < n; i++) {
            for(int j = i + 1; j < n; j++) {
                if(g[num[i]][num[j]]) {
                    if((j - i) > bandwidth){
                        bandwidth = (j - i);
                    }
                }
            }
        }
        if(bandwidth < mostBand) {
            for(int k = 0; k < n; k++) {
                ans[k] = num[k];
            }
            mostBand = bandwidth;
        }
    }
    else {
        for(int i = 0; i < 26; i++) {
            if(mk[i] && !vst[i]) {
                vst[i] = 1;
                dfs(i, n);
                vst[i] = 0;
            }
        }
    }
    top--;
}

int main()
{
   //freopen("in", "r", stdin);
    char data[1005];
    while(gets(data), strcmp(data, "#")) {
        memset(g, 0, sizeof(g));
        memset(mk, 0, sizeof(mk));
        memset(vst, 0, sizeof(vst));
        mostBand = 100;
        char *p;
        int l, a, b, n = 0;
        p = strtok(data, ";");
        while(p) {
            l = strlen(p);
            mk[a = p[0] - 'A'] = 1;
            for(int i = 2; i < l; i++) {
                b = p[i] - 'A';
                mk[b] = 1;
                g[a][b] = g[b][a] = 1;
            }
            p = strtok(NULL, ";");
        }
        for(int i = 0; i < 26; i++) {
            if(mk[i]) n++;
        }
        /*    printf("n = %d\n", n);
        for(int i = 0; i < 8; i++) {
            for(int j = 0; j < 8; j++) {
                if(g[i][j])printf("%c->%c\n", 'A' + i, 'A' + j);
            }
            printf("\n");
            }*/
        for(int i = 0; i < 26; i++) {
            top = 0;
            if(mk[i] && !vst[i]) {
                vst[i] = 1;
                dfs(i, n);
                vst[i] = 0;
            }
        }
        for(int i = 0; i < n; i++) {
            printf("%c ", ans[i] + 'A');
        }
        printf("-> %d\n", mostBand);
    }
}

Fucker 2010-11-03 21:04 发表评论