小学期训练题A-DP

A：点击打开链接

看不懂题实在是。。

看懂了在补吧。

B：点击打开链接

水DP

#include<iostream>
#include<cstdio>
#include<string>
#include<string.h>
using namespace std;
const int maxn = 100 + 5;
int dp[maxn][maxn];
int main()
{
    int N, P, M, T;
    while(cin >> N >> P >> M >> T)
    {
        memset(dp, 0, sizeof(dp));
        dp[0][P] = 1;
        for(int i = 1; i <= M; ++i)
            for(int j = 1; j <= N; ++j)
                dp[i][j] = dp[i-1][j-1] + dp[i-1][j+1];
        cout << dp[M][T] << endl;
    }
    return 0;
}

C： 点击打开链接

对我来说重点是那个i+j<=vis[i][j];

基本能力不足啊， 记忆化搜索

#include <iostream>
#include<cstdio>
#include<string.h>
#include <algorithm>

using namespace std;
const int maxn = 100 + 5;
const int maxm = 100 + 5;
int dp[maxn][maxm];
int vis[maxn][maxm];

int m,n;

int solve(int x,int y)
{
    if(x==n && y == m) return 1;

    if(dp[x][y] >= 0) return dp[x][y];

    int k = vis[x][y];
    int cnt  = 0;

    for(int i=0;i<=k ;i++)
    {
         for(int j=0;j<=k ;j++)
         {
             if(i==0 && j==0) continue;

             if(i+j<=k && i+x<=n &&j+y<=m) { cnt += solve(x+i, y+j); cnt %= 10000;}
         }
    }
    return dp[x][y] = cnt;
}
int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        memset(dp,-1,sizeof(dp));
        scanf("%d%d", &n,&m);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                scanf("%d", &vis[i][j]);
       solve(1, 1);
       int kk = dp[1][1];
       cout << kk << endl;
    }
    return 0;
}

D: 点击打开链接

最长公共子序列

#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
int n, m;
char s[1000], t[1000];
int dp[1000][1000];
int main()
{
    while(cin >> s >> t)
    {
        n = strlen(s);
        m = strlen(t);
        memset(dp,0,sizeof(dp));
        for(int i = 0; i < n; ++i)
        {
            for(int j = 0; j < m; ++j)
            {
                if(s[i] == t[j]) dp[i+1][j+1] = dp[i][j]+1;
                else dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
            }
        }
        cout << dp[n][m] << endl;
    }
}

E: 点击打开链接

水DP， 但是有路径保存

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>

#include<map>
#include<vector>

using namespace std;

const int maxn = 1000 + 5;

int main()
{
    pair <int, int> itv[maxn];
    map< pair<int, int>, int> vis;
    vector<int> path[maxn];

    int wight, speed;
    int cnt = 0;
    while(scanf("%d%d", &wight, &speed) != EOF)
    {

        itv[cnt].first = wight;
        itv[cnt].second = speed;
        vis[itv[cnt]] = cnt+1;
        ++cnt;
    }

    sort(itv, itv+cnt);

    for(int i = 0; i < cnt; ++i)
    {
        path[i].push_back(vis[itv[i]]);
    }

    vector<int> res;
    int max_n = -1;

    for(int i = 0; i < cnt; ++i)
    {
        for(int j = i + 1; j < cnt; ++j)
        {
            if(itv[i].first < itv[j].first && itv[i].second > itv[j].second)
            {
                if(path[i].size() + 1 > path[j].size())
                {
                    path[j] = path[i];
                    path[j].push_back(vis[itv[j]]);
                    int k = (int) path[j].size();
                    if(k > max_n)
                    {
                        res = path[j];
                        max_n = k;
                    }
                }
            }
        }
    }

    cout << max_n << endl;
    for(int i = 0; i < res.size(); ++i) cout << res[i] << endl;

    return 0;
}

F： 点击打开链接

数学题， 不能直接当dp写，内存不足

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int m, n;
    int vis[25];
    vis[0] = 5;
    for(int i = 1; i <= 24; ++i)
    {
        vis[i] = 2*(vis[i-1]+1) + 1;
    }
    while(cin >> m >> n)
    {
        if(m==1) cout << n+2 << endl;
        else if(m==2) cout << 2*(n+1) + 1 << endl;
        else cout << vis[n] << endl;
    }
    return 0;
}

G：

点击打开链接

数塔

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 100000 + 5;
int vis[maxn][12];
int res[maxn][12];
int main()
{
    int N;
    while(cin >> N && N)
    {
        memset(vis,0,sizeof(vis));
        memset(res,0,sizeof(res));
        int x,y;
        int K = 0;
        for(int i = 1; i <= N; ++i)
        {
            scanf("%d%d", &x, &y);
            if(y>K) K = y;
            vis[y][x]++;
        }
        int l = 4, r = 6;
        for(int i = 1; i <= 5; ++i)
        {
            for(int j = 0; j < l; ++j)
            {
                vis[i][j] = 0;
            }
            for(int j = r + 1; j < 11; ++j)
            {
                vis[i][j] = 0;
            }
            --l;
            ++r;
        }
        res[1][4] = vis[1][4];
        res[1][5] = vis[1][5];
        res[1][6] = vis[1][6];
        for(int i = 2; i <= K; ++i)
        {
            for(int j = 0; j < 11; ++j)
            {
                int maxn = 0;
                if(j==0)
                {
                    maxn = max(res[i-1][j], res[i-1][j+1]);
                    res[i][j] = maxn + vis[i][j];
                }
                else
                {
                    maxn = max(res[i-1][j-1], res[i-1][j]);
                    maxn = max(maxn, res[i-1][j+1]);
                    res[i][j] = maxn + vis[i][j];
                }
            }
        }
        int maxint = - 1;
        for(int i = 0; i < 11; ++i)
        {
            if(res[K][i] > maxint) maxint = res[K][i];
        }
        cout << maxint << endl;
    }
    return 0;
}