题目描述
题解
单纯形裸题。
代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int max_n=1e3+5;
const int max_m=1e4+5;
const double eps=1e-7;
const double inf=1e10;
double A[max_n][max_m],B[max_n],C[max_m],ans;
int n,m,L,R;
inline void pivot(int l,int e){
B[l]/=A[l][e];
for (int i=1;i<=n;++i)
if (i!=e)
A[l][i]/=A[l][e];
A[l][e]=1/A[l][e];
for (int i=1;i<=m;++i)
if (i!=l&&fabs(A[i][e])>eps){
B[i]-=B[l]*A[i][e];
for (int j=1;j<=n;++j)
if (j!=e)
A[i][j]-=A[l][j]*A[i][e];
A[i][e]=-A[l][e]*A[i][e];
}
ans+=C[e]*B[l];
for (int i=1;i<=n;++i)
if (i!=e)
C[i]-=C[e]*A[l][i];
C[e]=-C[e]*A[l][e];
}
inline void simplex(){
int e;
while (1){
for (e=1;e<=n;++e)
if (C[e]>eps) break;
if (e==n+1) break;
double delta=inf,t; int l;
for (int i=1;i<=m;++i)
if (A[i][e]>eps&&(t=B[i]/A[i][e])<delta){
delta=t;
l=i;
}
pivot(l,e);
}
}
int main(){
scanf("%d%d",&m,&n);
for (int i=1;i<=m;++i)
scanf("%lf",&B[i]);
for (int i=1;i<=n;++i){
scanf("%d%d%lf",&L,&R,&C[i]);
for (int j=L;j<=R;++j)
A[j][i]=1;
}
simplex();
printf("%.0lf\n",ans);
}
总结
①倒置的时候注意一下。