分数规划

 

本来在看《最小割模型在信息学竞赛中的应用》

中间蹦出了“分数规划”四个字。突然想起来，校赛被这道题搞过（当时因为数据水白嫖了一发

现在来学习一下。

分数规划是不符合贪心的！

比如一组数据

cost   12 4 15

value 15 5 25

第一个和第二个的比值是一样的 但是他们分别和第三个一起取的时候的出来的答案是不一样的

 

Dropping tests

入门题。

二分版本

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <functional>
#define ll long long
using namespace std;

const double EPS = 1e-5;
const int N = 1010;
double a[N], b[N];
double rate[N];

int main() {
    int n, m;
    while (~scanf("%d%d", &n, &m) && (n + m)) {
        m = n - m;
        for (int i = 1; i <= n; i++) scanf("%lf", &a[i]);
        for (int i = 1; i <= n; i++) scanf("%lf", &b[i]);
        double l = 0, r = 100;
        while (r - l > EPS) {
            double mid = (l + r) / 2.0;
            for (int i = 1; i <= n; i++) rate[i] = 100 * a[i] - mid * b[i];
            sort(rate + 1, rate + 1 + n, greater<double>());
            double check = 0;
            for (int i = 1; i <= m; i++) check += rate[i];
            if (check > EPS) l = mid;
            else r = mid;
        }
        printf("%.0f\n", r);
    }   
    return 0;
}

View Code

迭代版本

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
using namespace std;

const int N = 1010;
const double EPS = 1e-6;
struct P { double a, b, t; } p[N];
int n, m;
inline bool cmp(const P &a, const P &b) { return a.t > b.t; }

double check(double rate) {
    for (int i = 1; i <= n; i++) p[i].t = 100 * p[i].a - rate * p[i].b;
    double sum1 = 0, sum2 = 0;
    sort(p + 1, p + n + 1, cmp);
    for (int i = 1; i <= m; i++) sum1 += p[i].a, sum2 += p[i].b;
    return 100 * sum1 / sum2;  
}

int main() {
    while (~scanf("%d%d", &n, &m), n+m) {
        m = n - m;
        for (int i = 1; i <= n; i++) scanf("%lf", &p[i].a);
        for (int i = 1; i <= n; i++) scanf("%lf", &p[i].b);
        double rate = 0;
        while (1) {
            double r = rate;
            rate = check(rate);
            if (fabs(rate - r) < EPS) break;
        }
        printf("%.0f\n", rate);
    }  
    return 0;
}

View Code

 

Desert King

最优比率生成树。

二分 + 最小生成树

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int N = 1010;
const double EPS = 1e-6;
double cost[N][N], mincost[N], len[N][N];
bool vis[N];
struct Point { double x, y, z; } p[N]; 
int n;
inline double dis(Point &a, Point &b) {
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); 
}

double prim(double rate) {
    for (int i = 1; i <= n; i++) vis[i] = 0, mincost[i] = 1e10;
    mincost[1] = 0;
    double ans = 0;
    while (1) {
        int u = 0;
        for (int v = 1; v <= n; v++) if (!vis[v] && (!u || mincost[v] < mincost[u])) u = v;
        if (!u) break;
        vis[u] = true;
        ans += mincost[u];
        for (int v = 1; v <= n; v++) mincost[v] = min(mincost[v], cost[u][v] - rate * len[u][v]);
    }
    return ans; 
}

int main() {
    while (~scanf("%d", &n) && n) {
        for (int i = 1; i <= n; i++) scanf("%lf%lf%lf", &p[i].x, &p[i].y, &p[i].z);
        for (int i = 1; i <= n; i++) {
            for (int j = i + 1; j <= n; j++) {
                cost[i][j] = cost[j][i] = fabs(p[i].z - p[j].z);
                len[i][j] = len[j][i] = dis(p[i], p[j]);
            }
        }
        double l = 0, r = 1e7;
        while (r - l > EPS) {
            double mid = (l + r) / 2.0;
            if (prim(mid) > EPS) l = mid;
            else r = mid;
        }  
        printf("%.3f\n", r);
    }
    return 0;
}

View Code

迭代

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int N = 1010;
const double EPS = 1e-6;
double cost[N][N], mincost[N], len[N][N];
int pre[N];
bool vis[N];
struct Point { double x, y, z; } p[N]; 
int n;
inline double dis(Point &a, Point &b) {
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); 
}

double prim(double rate) {
    for (int i = 1; i <= n; i++) vis[i] = 0, mincost[i] = 1e10, pre[i] = 0;
    mincost[1] = 0;
    double sum1 = 0, sum2 = 0;
    while (1) {
        int u = 0;
        for (int v = 1; v <= n; v++) if (!vis[v] && (!u || mincost[v] < mincost[u])) u = v;
        if (!u) break;
        vis[u] = true;
        sum1 += cost[pre[u]][u], sum2 += len[pre[u]][u];
        for (int v = 1; v <= n; v++) {
            if (mincost[v] > cost[u][v] - rate * len[u][v]) {
                mincost[v] = cost[u][v] - rate * len[u][v];
                pre[v] = u;
            } 
        }
    }
    return sum1 / sum2; 
}

int main() {
    while (~scanf("%d", &n) && n) {
        for (int i = 1; i <= n; i++) scanf("%lf%lf%lf", &p[i].x, &p[i].y, &p[i].z);
        double sum1 = 0, sum2 = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = i + 1; j <= n; j++) {
                cost[i][j] = cost[j][i] = fabs(p[i].z - p[j].z);
                len[i][j] = len[j][i] = dis(p[i], p[j]);
            }
        }
        for (int i = 2; i <= n; i++) sum1 += cost[1][i], sum2 += len[1][i];
        double rate = sum1 / sum2;
        while (1) {
            double r = rate;
            rate = prim(rate);
            if (fabs(rate - r) < EPS) break;
        }  
        printf("%.3f\n", rate);
    }
    return 0;
}

View Code

 

Sightseeing Cows

最优比率环

二分 + dfs版spfa找环

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 10100;
const double EPS = 1e-7;
int n, m, cnt, head[N], f[N];
double w[N], dis[N];
bool vis[N];
struct Edge { int v, next, t; } edge[5050];
inline void add(int u, int v, int t) {
    edge[++cnt].v = v, edge[cnt].t = t, edge[cnt].next = head[u]; head[u] = cnt;
}

bool spfa(int u) {
    vis[u] = 1;
    for (int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].v;
        if (dis[v] > dis[u] + w[i]) {
            dis[v] = dis[u] + w[i];
            if (vis[v] || spfa(v)) {
                vis[u] = 0;
                return 1;
            }
        }
    }
    vis[u] = 0;
    return 0;  
}

bool check() {
    for (int i = 1; i <= n; i++) if (spfa(i)) return 1;
    return 0;
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) scanf("%d", &f[i]);
    while (m--) {
        int u, v, t;
        scanf("%d%d%d", &u, &v, &t);
        add(u, v, t);
    }
    double l = 0, r = 1e5;
    while (r - l > EPS) {
        double mid = (l + r) / 2.0;
        for (int i = 1; i <= cnt; i++) {
            int v = edge[i].v;
            w[i] = mid * 1.0 * edge[i].t - 1.0 * f[v];
        }
        if (check()) l = mid;
        else r = mid;   
    }
    printf("%.2f\n", l);
    return 0;
}

View Code

 

转载于:https://www.cnblogs.com/Mrzdtz220/p/10889881.html