SDKD Summer Team Contest D

E:点击打开链接

记忆化搜索， 主要是开始和结束的时候比较难控制；然后记忆化搜索有时候比DP好像很多，而且剪枝方便；

#include<cstdio>
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 50 + 5;
const int maxd = 10000 + 5;
vector<int> res[maxn];
int haved[maxd][maxn];
double dp[maxd][maxn];
int cnt[maxn];
int N, M, D;
double dfs(int s, int d, int k)
{
    if(d > D) return dp[d][s] = 1.0;
    if(haved[d][s]) return dp[d][s];
    double ans = 0;
    for(int i = 0;i < (int)res[s].size(); ++i)
        if(res[s][i] != k) ans += (1.0/cnt[s]) * dfs(res[s][i], d+1, k);
    haved[d][s] = 1;
    return dp[d][s] = ans;
}
int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        for(int i = 0; i < maxn; ++i) res[i].clear();
        memset(haved,0,sizeof(haved));
        memset(dp,0,sizeof(dp));
        memset(cnt,0,sizeof(cnt));
        scanf("%d%d%d", &N, &M, &D);
        for(int i  = 0; i < M; ++i)
        {
            int x, y;
            scanf("%d%d", &x, &y);
            cnt[x]++;
            cnt[y]++;
            res[x].push_back(y);
            res[y].push_back(x);
        }
        for(int i = 1; i <= N; ++i) res[0].push_back(i);
        cnt[0] = N;
        for(int i = 1; i <= N; ++i)
        {
            memset(haved,0,sizeof(haved));
            double ans = dfs(0, 0, i);
            printf("%.10lf\n", ans);
        }
    }
    return 0;
}

G: 点击打开链接

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
bool cmp(double a, double b)
{
    return a > b;
}
int main()
{
    int T;
    cin >>T;
    double vis[55];
    while(T--)
    {
        int n;
        cin >> n;
        double sum = 0;
        for(int i = 0; i < n; ++i) cin >> vis[i];
        sort(vis,vis+n, cmp);
        for(int i = 0; i < n;++i)
        {
            sum = sum +  (double)pow(0.95, i)*vis[i];
        }
        printf("%.10lf\n", sum);
    }
    return 0;
}