CodeForces 1579G :Minimal Coverage DP

传送门

题意

大意是有之前拜访的直线的端点当作起始点摆放，要求最小的覆盖并集长度

分析

我们把最后的线段的左端点始终对准0，用$f[i][j]$表示前$i$条线，右端点位于$j$位置的情况下的最小长度，那么，如果我们正着摆放的话，状态转移方程就是$f[i][j+a[i]]=min(f[i][j+a[i]],max(f[i-1][j],j+a[i]))$
如果反方向的话，就要考虑最后的左端点的位置，如果超过了0，则向右平移即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e4 + 10,M = 2010;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int n,a[N];
int f[N][M];

int main() {
    int T;
    read(T);
    while(T--){
        read(n);
        for(int i = 0;i <= n;i++)
            for(int j = 0;j < M;j++)
                f[i][j] = INF;
        for(int i = 1;i <= n;i++) read(a[i]);
        f[1][a[1]] = a[1];
        for(int i = 2;i <= n;i++)
            for(int j = 0;j < M;j++){
                if(f[i - 1][j] == INF) continue;
                if(j + a[i] < 2000) f[i][j + a[i]] = min(f[i][j + a[i]],max(f[i - 1][j],j + a[i]));
                if(j <= a[i]) f[i][0] = min(f[i][0],f[i - 1][j] + a[i] - j);
                else f[i][j - a[i]] = min(f[i][j - a[i]],f[i - 1][j]);
            }
        int ans = INF;
        for(int i = 0;i < M;i++) ans = min(ans,f[n][i]);
        di(ans);
    }
    return 0;
}