节约粮食-线性规划

最新推荐文章于 2024-06-22 21:53:36 发布

牛小汉

最新推荐文章于 2024-06-22 21:53:36 发布

阅读量255

点赞数

分类专栏：算法答案深圳技术大学文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/weixin_62377608/article/details/131833854

版权

算法答案深圳技术大学专栏收录该内容

58 篇文章 17 订阅

订阅专栏

Description:

Accept:

#include<bits/stdc++.h>

using namespace std;
const int maxn = 1e3 + 10;
const double inf = 1e20;
const double eps = 1e-8;
struct Simplex
{
    vector<double> b, c;
    vector<vector<double> >a;
    double z;
    int n, m;
    void Init(int n_, int m_)
    {
        n = n_, m = m_;
        b.resize(m);
        a.resize(m);
        c.resize(n);
        for(auto &x : a) x.resize(n + 1), fill(x.begin(), x.end(), 0);
        std::fill(b.begin(), b.end(), 0);
        std::fill(c.begin(), c.end(), 0);
        z = 0;
    }
    void Pivot(int k, int l)
    {
        b[l] /= a[l][k];
        for(int j = 0; j < n; j ++)
            if(j != k) a[l][j] /= a[l][k];
        for(int i = 0; i < m; i ++)
        {
            if(i != l && fabs(a[i][k]) > eps)
            {
                b[i] -= a[i][k] * b[l];
                for(int j = 0; j < n; j ++)
                    if(j != k) a[i][j] -= a[i][k] * a[l][j];
                a[i][k] /= -a[l][k];
            }
        }
        z += c[k] * b[l];
        for(int j = 0; j < n; j ++)
            if(j != k) c[j] -= c[k] * a[l][j];
        c[k] /= -a[l][k];
        a[l][k] = 1 / a[l][k];
    }
    double Solve()
    {
        while(true)
        {
            int k = 0, l = 0;
            double minc = inf;
            for(int i = 0; i < n; i ++)
                if(c[i] < minc)
                    minc = c[k = i];
            if(minc > -eps) return z;
            double minba = inf;
            for(int i = 0; i < m; i ++)
                if(a[i][k] > eps && minba - b[i] / a[i][k] > eps)
                    minba = b[i] / a[i][k], l = i;
            if(minba == inf) return inf;
            Pivot(k, l);
        }
    }
};
int n, m;
const int nlimit = 24;
Simplex spx;
int main()
{
    scanf("%d%d", &n, &m) ;
    
        spx.Init(n + m, m);
        for(int i = 0; i < n; i ++)
            scanf("%lf", &spx.c[i]), spx.c[i] = -spx.c[i];
        for(int i = 0; i < m; i ++)
        {
            for(int j = 0; j < n; j ++)
                scanf("%lf", &spx.a[i][j]);
            scanf("%lf", &spx.b[i]);
            spx.a[i][n + i] = 1;
        }
        printf("Nasa can spend %d taka.", (int)ceil(-spx.Solve() * m));
    
    return 0;
}