BZOJ3265: 志愿者招募加强版(线性规划)

Time Limit: 20 Sec  Memory Limit: 512 MB
Submit: 809  Solved: 417
[Submit][Status][Discuss]

Description

Input

Output

Sample Input

3 3
2 3 4
1 1 2 2
1 2 3 5
1 3 3 2

Sample Output

14

HINT

Source

这题是来搞笑的么？？

除了多循环几次之外和原版有啥区别？qwq、

#include<cstdio>
#include<algorithm>
#include<cmath>
#define LL long long
using namespace std;
const int MAXN = , INF = 1e9 + ;
const double eps = 1e-;
inline int read() {
    char c = getchar();int x = ,f = ;
    while(c < '' || c > ''){if(c == '-')f = -;c = getchar();}
    while(c >= '' && c <= ''){x = x *  + c - '',c = getchar();}
    return x * f;
}
int N, M;
LL a[][];
void Pivot(int l, int e) {
    double t = a[l][e]; a[l][e] = ;
    for(int i = ; i <= N; i++) a[l][i] /= t;
    for(int i = ; i <= M; i++) {
        if(i != l && abs(a[i][e]) > eps) {
            t = a[i][e]; a[i][e] = ;
            for(int j = ; j <= N; j++)
                a[i][j] -= a[l][j] * t;
        }
    }
}
bool simplex() {
    while() {
        int l = , e = ; double mn = INF;
        for(int i = ; i <= N; i++)
            if(a[][i] > eps)
                {e = i; break;}
        if(!e) break;
        for(int i = ; i <= M; i++)
            if(a[i][e] > eps && a[i][] / a[i][e] < mn)
                mn = a[i][] / a[i][e], l = i;
        Pivot(l, e);
    }
    return ;
}
int main() {
//    freopen("a.in", "r", stdin);
    srand();
    N = read(); M = read();
    for(int i = ; i <= N; i++) a[][i] = read();
    for(int i = ; i <= M; i++) {
        int K = read();
        while(K--) {
            int S = read(), T = read();
            for(int j = S; j <= T; j++)
                a[i][j] = ;
        }
        int C = read();
        a[i][] = C;
    }
    simplex();
    printf("%lld", -a[][]);
    return ;
}