简单分数统计 + nocrossing(day 4)_no crossing csdn-CSDN博客

本文链接：https://blog.csdn.net/m0_61837058/article/details/125278663

本文档展示了如何使用C++编程解决两个不同的问题：统计简单分数并更新成绩，以及实现区间dp算法来处理区间问题。首先介绍了分数统计部分，涉及字符串映射和学生成绩累加；其次，展示了区间dp的原理和应用，通过递推求解经过指定点的最短路径。

摘要由CSDN通过智能技术生成

#include<bits/stdc++.h>
using namespace std;

#define x first
#define y second
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;

ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
const int N = 210;
struct stu
{
    ll sum;
    string name;
}q[N];
map<string, int> s;
map<string, int> r;

int main()
{
    IOS;
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i ++ )
    {
        cin >> q[i].name;
        r[q[i].name] = i;//编号
    }

   
    while(m -- )
    {
        string t;
        int grade;
        cin >> t >> grade;
        s[t] = grade;
    }
    while(k -- )
    {
        string id, t, tp;
        cin >> id >> t >> tp;
        if(tp == "AC")  
        {
            int i = r[id];
            int grade = s[t];
            q[i].sum += grade;
        }
    }
    for (int i = 1; i <= n; i ++ )
        cout << q[i].name << ' ' << q[i].sum << endl;

    
    return 0;
}

nocrossing(div1)

区间dp(还没学过太难了呀)

dp[k][i][j][0/1]:表示当前经过了k个点，并且下一次可行区间是在i-j中，0表示当前在坐去间，1表示当前在右区间，然后去更新。见博客题解

#include<bits/stdc++.h>
using namespace std;

#define x first
#define y second
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;

ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
const int N = 110, INF = 1e9;
int g[N][N];
int dp[N][N][N][2];//经过的点的数量 左端点 右端点 在左/右端点
int n, m, k;

int main()
{
    IOS;
    cin >> n >> k >> m;
    memset(g, 0x3f, sizeof g);
    memset(dp, 0x3f, sizeof dp);
    while (m -- )
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a][b] = min(g[a][b], c);
    }
    for (int i = 1; i <= n; i ++ )  dp[1][0][i][1] = dp[1][i][n + 1][0] = 0;//每个孤立的点为0(可以从这些点出发)

    for (int a = 2; a <= k; a ++ )//经过了a个点
    {
        for (int l = 0; l <= n - 1; l ++ )
        {
            for (int r = l; r <= n + 1; r ++ )
            {
                for (int mid = l + 1; mid <= r - 1; mid ++ )
                {
                    int mini = min(dp[a - 1][l][r][0] + g[l][mid], dp[a - 1][l][r][1] + g[r][mid]);
                    dp[a][l][mid][1] = min(dp[a][l][mid][1], mini);
                    dp[a][mid][r][0] = min(dp[a][mid][r][0], mini);
                }
            }
        }
    }
    int res = INF;
    for (int i = 0; i <= n; i ++ )
        for (int j = 1; j <= n + 1; j ++ )  res = min(res, min(dp[k][i][j][0], dp[k][i][j][1]));

    cout << (res == INF ? -1 : res) << endl;

    
    return 0;
}