河南省第六届ACM程序设计大赛

C:  最舒适的路线 (并查集)

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define INF 20000000

struct point
{
    int x, y, v;
};

point node[];
int fa[];

bool cmp(point a, point b)
{
    return a.v < b.v;//边从小到大
}
int find(int n)
{
    return n == fa[n] ? n : fa[n] = find(fa[n]);
}
int gcd(int a, int b)
{
    return b ? gcd(b, a%b) : a;
}
int main()
{
    int i, j, t, e;
    int start, end, row, edge, maxv, minv;
    double radio;
    cin>>t;
    while(t--)
    {
        cin>>row>>edge;
        for(i = ; i <= edge; i++)
        {
            cin>>node[i].x>>node[i].y>>node[i].v;
        }
        cin>>start>>end;
        sort(node + , node+edge + , cmp);
        radio = INF;
        for(e = edge; e > ; e--) //从最大的边开始，将比它小的边加入
        {
            for(i =; i <= row; i++)
                fa[i] = i;
            for(i = e; i > ; i--)
            {
                int a = find(node[i].x);
                int b = find(node[i].y);
                if(a == b)
                    continue;
                else
                    fa[a] = b;
                if(find(start) == find(end))
                    break;//起点和终点在都一个集合里
            }
            if(i == )
                break;//如果把边都加进去完了，说明起点和终点不连通
            if(node[e].v/(node[i].v*1.0) < radio)
            {
                radio = node[e].v / (node[i].v * 1.0);
                maxv = node[e].v;
                minv = node[i].v;
            }
        }
        int g = gcd(maxv, minv);
        if(radio == INF)
            printf("IMPOSSIBLE\n");
        else if(maxv % minv == )
            printf("%d\n", maxv / minv);
        else
            printf("%d/%d\n", maxv/g, minv/g);
    }
    return ;
}

D: 探 寻 宝 藏 (多线程dp)

#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef unsigned long long LL;

#define N 110
#define met(a,b) (memset(a,b,sizeof(a)))
#define max4(a,b,c,d) (max(max(a,b),max(c,d)))

int a[N][N], dp[N*][N][N];

int main()
{
    int n, m, T;

    scanf("%d", &T);

    while(T--)
    {
        int i, j, k;

        met(a, );
        met(dp, );

        scanf("%d%d", &n, &m);

        for(i=; i<=n; i++)
        for(j=; j<=m; j++)
            scanf("%d", &a[i][j]);

        dp[][][] = a[][];
        for(k=; k<=n+m-; k++)
        {
            for(i=; i<=n; i++) ///i 代表第一个人所在的行
            for(j=; j<=n; j++) ///j 代表第二个人所在的行
            {
                   dp[k][i][j] = max4(dp[k-][i][j], dp[k-][i][j-], dp[k-][i-][j], dp[k-][i-][j-]);
                if(i!=j)
                    dp[k][i][j] += a[i][k+-i] + a[j][k+-j];
                else
                     dp[k][i][j] += a[i][k+-i];
            }
        }

        printf("%d\n", dp[n+m-][n][n]);
    }
    return ;
}

G:Adjacent Bit Counts （递推）

#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef unsigned long long LL;

#define N 110
#define met(a,b) (memset(a,b,sizeof(a)))
#define max4(a,b,c,d) (max(max(a,b),max(c,d)))

LL dp[N][N][];

///dp[i][j][0] i位数，fun[i]为j的最后一位为0
///dp[i][j][1] i位数，fun[i]为j的最后一位为1
///dp[i][j][1] dp[i][j][0]与dp[i][j][1]之和

int main()
{
    int T, i, j;

    dp[][][] = dp[][][] = ;
    dp[][][] = dp[][][] = ;
    dp[][][] = ;

    for(i=; i<N; i++)
    {
        for(j=; j<i; j++)
        {
            dp[i][j][] = dp[i-][j][];
            dp[i][j][] = dp[i-][j][];
            if(j>=) dp[i][j][] += dp[i-][j-][];
            dp[i][j][] = dp[i][j][] + dp[i][j][];
        }
    }

    scanf("%d", &T);

    while(T--)
    {
       int n, m;

       scanf("%d%d", &n, &m);

       printf("%lld\n", dp[n][m][]);
    }
    return ;
}

H: River Crossing ( 完全背包)

#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef unsigned long long LL;
#define INF 0x3f3f3f3f
#define N 1100
#define met(a,b) (memset(a,b,sizeof(a)))
#define max4(a,b,c,d) (max(max(a,b),max(c,d)))

int a[N], dp[N];
///dp[i]代表i个羊一起过河需要花费的最短时间

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n, m, i, j;

        scanf("%d%d", &n, &m);

        for(i=; i<=n; i++)
            scanf("%d", &a[i]);

        dp[] = a[] + m;
        for(i=; i<=n; i++)
            dp[i] = dp[i-]+a[i];

        dp[] = ;
        for(i=; i<=n; i++)
        {
            for(j=i; j<=n; j++)
            {
               dp[j] = min(dp[j], dp[j-i]+dp[i]+m);
            }
        }

        printf("%d\n", dp[n]);
    }
    return ;
}