和bzoj1061基本相同。对偶型线性规划,单纯性求解即可。
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 10010
#define M 1010
#define eps 1e-7
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(S==T) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int m,n;
double a[M][N];
inline void pivot(int l,int e){
double t=a[l][e];a[l][e]=1;
for(int i=0;i<=n;++i) a[l][i]/=t;
for(int i=0;i<=m;++i){
if(i==l||abs(a[i][e])<eps) continue;
t=a[i][e];a[i][e]=0;
for(int j=0;j<=n;++j) a[i][j]-=a[l][j]*t;
}
}
inline bool simplex(){
while(1){
int l=0,e=0;double mn=inf;
for(int i=1;i<=n;++i) if(a[0][i]>eps){e=i;break;}
if(!e) return 1;
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;
if(!l) return 0;pivot(l,e);
}
}
int main(){
// freopen("a.in","r",stdin);
m=read();n=read();
for(int i=1;i<=m;++i) a[i][0]=read();
for(int i=1;i<=n;++i){
int x=read(),y=read();a[0][i]=read();
for(int j=x;j<=y;++j) a[j][i]=1;
}simplex();printf("%d\n",-(int)a[0][0]);
return 0;
}