题意
分析
直接上单纯形。。。
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const double eps=1e-7;
int n,m;
double b[1005],c[10005],a[1005][10005],v;
void pivot(int e,int l)
{
for (int i=1;i<=n;i++) if (i!=e) a[l][i]/=a[l][e];
b[l]/=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)
{
for (int j=1;j<=n;j++) if (j!=e) a[i][j]-=a[l][j]*a[i][e];
b[i]-=b[l]*a[i][e];a[i][e]=-a[l][e]*a[i][e];
}
v+=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];
}
double simplex()
{
while (1)
{
int e,l;
for (int i=1;i<=n;i++)
if (c[e=i]>eps) break;
if (c[e]<eps) return v;
double tmp=1e10;
for (int i=1;i<=m;i++)
if (a[i][e]>eps&&b[i]/a[i][e]<tmp) tmp=b[i]/a[i][e],l=i;
pivot(e,l);
}
}
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++)
{
int l,r,d;
scanf("%d%d%d",&l,&r,&d);
for (int j=l;j<=r;j++) a[j][i]=1;
c[i]=d;
}
double ans=simplex();
printf("%d",(int)(ans+0.1));
return 0;
}