cf744 div3 G Minimal Coverage

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

状态标识：
f[i][k]表示前i个直线能摆放的,当前距离最左边曾到过的端点为参照系的距离为k ，的
所有方案总的覆盖并集长度的最小值

有状态转移方程:
//2000是所能保证的最差情况的最优解，鉴于ai<=1000；此状态表示如果向右摆放所能得到的总长度最小值
if(k+a[i]<=2000) f[i][k+a[i]]=min(f[i][k+a[i]],max(f[i-1][k],k+a[i]));
//表示向左摆放，如果比当前参考系还要负的话，就整体平移参考系
if(k>=a[i]) f[i][k-a[i]]=min(f[i][k-a[i]],f[i-1][k]);
else f[i][0]=min(f[i][0],f[i-1][k]+a[i]-k);

#include<unordered_set>
#include<unordered_map>
#include<algorithm>
#include<functional>
#include<string.h>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<map>

using namespace std;
//================================
#define debug(a) cout << #a": " << a << endl;
#define N 2010
const int M = 10010;
const int INF = 0x3f3f3f3f;
//================================
typedef pair<int,int> pii;
#define x first
#define y second
typedef long long LL; typedef unsigned long long ULL; typedef long double LD;
inline LL read() { LL s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == '-') w = -1; for (; isdigit(ch); ch = getchar())    s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; }
inline void print(LL x, int op = 10) { if (!x) { putchar('0'); if (op)  putchar(op); return; }  char F[40]; LL tmp = x > 0 ? x : -x; if (x < 0)putchar('-');  int cnt = 0;    while (tmp > 0) { F[cnt++] = tmp % 10 + '0';     tmp /= 10; }    while (cnt > 0)putchar(F[--cnt]);    if (op) putchar(op); }
//================================= 
int T,n,m;
int f[M][N],a[M];
 
void init(){
	for(int i=0;i<=n;i++)
		for(int j=0;j<2010;j++)
			f[i][j]=0x3f3f3f3f;
	f[0][0]=1;
	n=read();
	for(int i=1;i<=n;i++)
		a[i]=read();
}
 
void solve(){
	for(int i=1;i<=n;i++)
		for(int k=0;k<=2000;k++){
			if(f[i-1][k]==INF) continue;
			if(k+a[i]<=2000) f[i][k+a[i]]=min(f[i][k+a[i]],max(f[i-1][k],k+a[i]));
			if(k>=a[i]) f[i][k-a[i]]=min(f[i][k-a[i]],f[i-1][k]);
			else f[i][0]=min(f[i][0],f[i-1][k]+a[i]-k);
		}
	int mx=0x3f3f3f3f;
	for(int i=0;i<=2000;i++)
		mx=min(mx,f[n][i]);
	print(mx);
}
//=================================
int main(){
	memset(f,0x3f,sizeof f);
	T=read();
    while(T--)
    {
    	init();
    	solve();
    }
	return 0;
}