标签：
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 8331 | Accepted: 2791 |
Description
Farmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows must decide how best to spend their free time.
Fortunately, they have a detailed city map showing the L (2 ≤ L ≤ 1000) major landmarks (conveniently numbered 1.. L) and the P (2 ≤ P ≤ 5000) unidirectional cow paths that join them. Farmer John will drive the cows to a starting landmark of their choice, from which they will walk along the cow paths to a series of other landmarks, ending back at their starting landmark where Farmer John will pick them up and take them back to the farm. Because space in the city is at a premium, the cow paths are very narrow and so travel along each cow path is only allowed in one fixed direction.
While the cows may spend as much time as they like in the city, they do tend to get bored easily. Visiting each new landmark is fun, but walking between them takes time. The cows know the exact fun values Fi (1 ≤ Fi ≤ 1000) for each landmark i.
The cows also know about the cowpaths. Cowpath i connects landmark L1i to L2i (in the direction L1i -> L2i ) and requires time Ti (1 ≤ Ti ≤ 1000) to traverse.
In order to have the best possible day off, the cows want to maximize the average fun value per unit time of their trip. Of course, the landmarks are only fun the first time they are visited; the cows may pass through the landmark more than once, but they do not perceive its fun value again. Furthermore, Farmer John is making the cows visit at least two landmarks, so that they get some exercise during their day off.
Help the cows find the maximum fun value per unit time that they can achieve.
Input
* Line 1: Two space-separated integers: L and P
* Lines 2..L+1: Line i+1 contains a single one integer: Fi
* Lines L+2..L+P+1: Line L+i+1 describes cow path i with three space-separated integers: L1i , L2i , and Ti
Output
* Line 1: A single number given to two decimal places (do not perform explicit rounding), the maximum possible average fun per unit time, or 0 if the cows cannot plan any trip at all in accordance with the above rules.
Sample Input
5 7 30 10 10 5 10 1 2 3 2 3 2 3 4 5 3 5 2 4 5 5 5 1 3 5 2 2
Sample Output
6.00
题意：给出一个有向图 问求一个回路 使得回路上的点权之和/边权之和最大
01分数规划，简单构造，将点权转移到边权上~因为一个环上的点和边的数量是相等的~
设i,j之间初始边权为w[i][j]，修改后的边权为g[i][j]，则g[i][j]=w[i][j]*mid+val[i]
spfa判负环即可~
其实说起来很简单写的时候好烦。。。。因为G++%lf输出问题WA了好多次。。。
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cstdlib> 5 #include <algorithm> 6 #include <cmath> 7 using namespace std; 8 9 const int maxn = 1010; 10 const int maxm = 1000010; 11 int a[maxm], b[maxm]; 12 int head[maxn], next[maxm], to[maxm]; 13 int q[maxn*5], im[maxm]; 14 int vis[maxn]; 15 int cnt, st; 16 int n, m; 17 double l, r, mid; 18 double c[maxm], dis[maxn], len[maxm], val[maxn]; 19 20 inline void add(int u, int v, double w); 21 bool dfs(int u); 22 bool spfa(); 23 24 int main(){ 25 while(scanf("%d%d", &n, &m)!=EOF){ 26 for(int i = 1; i <= n; ++i){ 27 scanf("%lf", &val[i]); 28 } 29 30 memset(head, -1, sizeof(head)); 31 cnt = 0; 32 for(int i = 1; i <= m; ++i){ 33 scanf("%d%d%lf", &a[i], &b[i], &c[i]); 34 add(a[i], b[i], c[i]); 35 } 36 37 l = 0.0; 38 r = 1000.0; 39 while(r-l > 1e-4){ 40 mid = (r+l) / 2.0; 41 if(spfa()){ 42 l = mid; 43 } 44 else{ 45 r = mid; 46 } 47 } 48 printf("%.2f\n", mid); 49 } 50 return 0; 51 } 52 53 inline void add(int u, int v, double w){ 54 to[cnt] = v; 55 len[cnt] = w; 56 next[cnt] = head[u]; 57 head[u] = cnt++; 58 } 59 60 bool dfs(int u){ 61 vis[u] = st; 62 for(int i = head[u]; ~i; i = next[i]){ 63 if(dis[to[i]] > dis[u] + len[i]*mid - val[u]){ 64 dis[to[i]] = dis[u] + len[i]*mid - val[u]; 65 if(vis[to[i]] == st){ 66 return true; 67 } 68 else if(dfs(to[i])){ 69 return true; 70 } 71 } 72 } 73 vis[u] = 0; 74 return false; 75 } 76 77 bool spfa(){ 78 memset(vis, 0, sizeof(vis)); 79 for(st = 1; st <= n; ++st){ 80 if(dfs(st)){ 81 return true; 82 } 83 } 84 return false; 85 }
标签：
原文地址：http://www.cnblogs.com/auguralpha/p/4593281.html
