单纯形&&线性规划

沦为了背板子...wyfcyx的ppt

#include<bits/stdc++.h>
using namespace std;
const int N = ;
const double eps = 1e-, inf = 1e18;
int n, m, l, e, t;
double k;
double a[N][N], ans[N];
int id[N << ];
void pivot(int l, int e)
{
    swap(id[n + l], id[e]);
    double r = a[l][e]; a[l][e] = ;
    for(int i = ; i <= n; ++i) a[l][i] /= r;
    for(int i = ; i <= m; ++i) if(i != l)
    {
        double r = a[i][e]; a[i][e] = ;
        for(int j = ; j <= n; ++j) a[i][j] -= r * a[l][j];
    }
}
int main()
{
    scanf("%d%d%d", &n, &m, &t);
    for(int i = ; i <= n; ++i) scanf("%lf", &a[][i]), id[i] = i;
    for(int i = ; i <= m; ++i)
    {
        for(int j = ; j <= n; ++j) scanf("%lf", &a[i][j]);
        scanf("%lf", &a[i][]);
    }
    while(true)
    {
        l = e = ; k = -eps;
        for(int i = ; i <= m; ++i) if(a[i][] < k) { l = i; k = a[i][]; }
        if(!l) break;
        for(int i = n; i; --i) if(a[l][i] < -eps)
        { e = i; break; }
        if(!e) { puts("Infeasible"); return ; }
        pivot(l, e);
    }
    while(true)
    {
        l = e = ;
        for(int i = ; i <= n; ++i) if(a[][i] > eps)
        { e = i; break; }
        if(!e) break;
        k = inf;
        for(int i = ; i <= m; ++i) if(a[i][e] > eps && a[i][] / a[i][e] < k)
        { k = a[i][] / a[i][e]; l = i; }
        if(!l) { puts("Unbounded"); return ; }
        pivot(l, e);
    }
    printf("%.10f\n", -a[][]);
    if(!t) return ;
    for(int i = ; i <= m; ++i) ans[id[i + n]] = a[i][];
    for(int i = ; i <= n; ++i) printf("%.10f ", ans[i]);
    return ;
}