看这篇博客会有很好的理解:https://www.hrwhisper.me/introduction-to-simplex-algorithm/
本文代码参考了:https://www.cnblogs.com/Mychael/p/9249404.html 作者:Mychael
题意:
告诉你 每种线段的cost 还有每个线段的位置
约束条件是 每个点被覆盖的次数大于等于ai
解:
1.标准的模板 求解的是: Z=max(c1x1+c2x2+.....cnxn); -----> ans==-z and 约束条件是:ai
(1)矩阵的左上角是-Z (2)第一列是bi(3)第一行是cj (4)主题部分是aij
2.我们简单修改矩阵的符号,---->改变不等式的符号(约束条件)和 Z取最大值还是最小
目前还没用到对偶的性质,可以直接通过不等式的正负号来改边对偶 而不需要进行乱乱的矩阵转置
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<map>
#define Redge(u) for (int k = h[u],to; k; k = ed[k].nxt)
#define REP(i,n) for (int i = 1; i <= (n); i++)
#define mp(a,b) make_pair<int,int>(a,b)
#define cls(s) memset(s,0,sizeof(s))
#define cp pair<int,int>
#define LL long long int
using namespace std;
const int maxn = 1005,maxm = 10005;
const double eps = 1e-8,INF = 1e15;
inline int read(){
int out = 0,flag = 1; char c = getchar();
while (c < 48 || c > 57){if (c == '-') flag = -1; c = getchar();}
while (c >= 48 && c <= 57){out = (out << 3) + (out << 1) + c - 48; c = getchar();}
return out * flag;
}
int n,m;
double a[maxn][maxm];
void Pivot(int l,int e){
double t = a[l][e]; a[l][e] = 1;
for (int j = 0; j <= n; j++) a[l][j] /= t;
for (int i = 0; i <= m; i++) if (i != l && fabs(a[i][e]) > eps){
t = a[i][e]; a[i][e] = 0;
for (int j = 0; j <= n; j++)
a[i][j] -= a[l][j] * t;
}
}
void init(){
while (true){
int l = 0,e = 0;
for (int i = 1; i <= m; i++) if (a[i][0] < -eps && (!l || (rand() & 1))) l = i;
if (!l) break;
for (int j = 1; j <= n; j++) if (a[l][j] < -eps && (!e || (rand() & 1))) e = j;
Pivot(l,e);
}
}
void simplex(){
while (true){
int l = 0,e = 0; double mn = INF;
for (int j = 1; j <= n; j++) if (a[0][j] > eps){e = j; break;}
if (!e) break;
for (int i = 1; i <= m; i++) if (a[i][e] > eps && a[i][0] / a[i][e] < mn)
mn= a[i][0] / a[i][e],l = i;
Pivot(l,e);
}
}
int main(){
#ifdef local
freopen("input2.txt","r",stdin);
#endif // local
srand(time(NULL));
m = read(); n = read(); int L,R;
REP(i,m){
a[i][0]=-read();
}
REP(j,n){
L = read(); R = read();
a[0][j]=-read();
for(int i=L;i<=R;i++){
a[i][j]=-1;
}
}
///888888888888888888888888888888888888888888888888
init(); simplex();
printf("%lld\n",(LL)(a[0][0] + 0.5));
return 0;
}