补题进度:1/10
毕克大爷也出的太难了吧
HDU6346 整数规划
给定$n×n$个整数$a_{ij}(1<=i,j<=n)$,要找$2n$个整数$x_1,x_2,x_3…x_n,y_1,y_2,y_3…y_n$,在满足$x_i+y_i<=a_{ij}(1<=i,j<=n)$的约束下最大化目标函数
$$
\sum_{i=1}^{n}{x_i}+\sum_{i=1}^{n}{y_i} \ \ (n<=200)
$$
2018 Multi-University Training Contest 7(HDU)
Posted on
|
In
ACM
,
Multi-school
补题进度:1/11 (13)
实现多校第一场暴零
UESTC的霸霸们教做人