志愿者招募-线性规划

Description:

 

Accept:

#include <bits/stdc++.h>
using namespace std;
#define INF 1e10
#define EPS 1e-7
int n, m;
namespace Linear_Programming{
    double A[10100][1010],b[10100],c[1010],v;
    void Pivot(int l,int e)
    {
        int i,j;

        b[l]/=A[l][e];
        for(i=1;i<=n;i++)
            if(i!=e)
                A[l][i]/=A[l][e];
        A[l][e]=1/A[l][e];

        for(i=1;i<=m;i++)
            if(i!=l&&fabs(A[i][e])>EPS)
            {
                b[i]-=A[i][e]*b[l];
                for(j=1;j<=n;j++)
                    if(j!=e)
                        A[i][j]-=A[i][e]*A[l][j];
                A[i][e]=-A[i][e]*A[l][e];
            }

        v+=c[e]*b[l];
        for(i=1;i<=n;i++)
            if(i!=e)
                c[i]-=c[e]*A[l][i];
        c[e]=-c[e]*A[l][e];
    }
    double Simplex()
    {
        int i,l,e;
        while(1)
        {
            for(i=1;i<=n;i++)
                if(c[i]>EPS)
                    break;
            if((e=i)==n+1)
                return v;
            double temp=INF;
            for(i=1;i<=m;i++)
                if( A[i][e]>EPS && b[i]/A[i][e]<temp )
                    temp=b[i]/A[i][e],l=i;
            if(temp==INF) return INF;
            Pivot(l,e);
        }
    }
}

int main(){
    using namespace Linear_Programming;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%lf", &c[i]);
    for(int i = 1; i <= m; i++){
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        for(int j = x; j <= y; j++){
            A[i][j] = 1;
        }
        b[i] = z;
    }
    double ans = Simplex();
    printf("%d\n", (int)(ans + 0.5));
    return 0;
}