Codeforces Round #254 (Div. 2)444A - DZY Loves Physics (枚举权值求最大)
2014-07-07 15:13
375 查看
C. DZY Loves Physics
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
where v is the sum of the values of the nodes, e is
the sum of the values of the edges.
Once DZY got a graph G, now he wants to find a connected induced subgraph G' of
the graph, such that the density of G' is as large as possible.
An induced subgraph G'(V', E') of a graph G(V, E) is
a graph that satisfies:
;
edge
if
and only if
,
and edge
;
the value of an edge in G' is the same as the value of the corresponding edge in G,
so as the value of a node.
Help DZY to find the induced subgraph with maximum density. Note that the induced subgraph you choose must be connected.
Input
The first line contains two space-separated integers n (1 ≤ n ≤ 500),
.
Integer n represents the number of nodes of the graph G, m represents
the number of edges.
The second line contains n space-separated integers xi (1 ≤ xi ≤ 106),
where xi represents
the value of the i-th node. Consider the graph nodes are numbered from 1 to n.
Each of the next m lines contains three space-separated integers ai, bi, ci (1 ≤ ai < bi ≤ n; 1 ≤ ci ≤ 103),
denoting an edge between node ai and bi with
value ci. The
graph won't contain multiple edges.
Output
Output a real number denoting the answer, with an absolute or relative error of at most 10 - 9.
Sample test(s)
input
output
input
output
input
output
Note
In the first sample, you can only choose an empty subgraph, or the subgraph containing only node 1.
In the second sample, choosing the whole graph is optimal.
AC代码:
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
where v is the sum of the values of the nodes, e is
the sum of the values of the edges.
Once DZY got a graph G, now he wants to find a connected induced subgraph G' of
the graph, such that the density of G' is as large as possible.
An induced subgraph G'(V', E') of a graph G(V, E) is
a graph that satisfies:
;
edge
if
and only if
,
and edge
;
the value of an edge in G' is the same as the value of the corresponding edge in G,
so as the value of a node.
Help DZY to find the induced subgraph with maximum density. Note that the induced subgraph you choose must be connected.
Input
The first line contains two space-separated integers n (1 ≤ n ≤ 500),
.
Integer n represents the number of nodes of the graph G, m represents
the number of edges.
The second line contains n space-separated integers xi (1 ≤ xi ≤ 106),
where xi represents
the value of the i-th node. Consider the graph nodes are numbered from 1 to n.
Each of the next m lines contains three space-separated integers ai, bi, ci (1 ≤ ai < bi ≤ n; 1 ≤ ci ≤ 103),
denoting an edge between node ai and bi with
value ci. The
graph won't contain multiple edges.
Output
Output a real number denoting the answer, with an absolute or relative error of at most 10 - 9.
Sample test(s)
input
1 0 1
output
0.000000000000000
input
2 1 1 2 1 2 1
output
3.000000000000000
input
5 6 13 56 73 98 17 1 2 56 1 3 29 1 4 42 2 3 95 2 4 88 3 4 63
output
2.965517241379311
Note
In the first sample, you can only choose an empty subgraph, or the subgraph containing only node 1.
In the second sample, choosing the whole graph is optimal.
AC代码:
#include <stdio.h> #define max(a,b) a>b?a:b; //author:XXYY int main() { int n,m,x,y,z,i,v[505]; double ans=0; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) scanf("%d",&v[i]); while(m--){ scanf("%d%d%d",&x,&y,&z); ans=max(ans,1.0*(v[x]+v[y])/z); } printf("%.12lf\n",ans); return 0; }
相关文章推荐
- Codeforces Round #254 (Div. 2) C (444A)DZY Loves Physics
- CF 444A(DZY Loves Physics-低密度脂蛋白诱导子图)
- CF 444A(DZY Loves Physics-诱导子图的密度)
- Codeforces Round #254 (Div. 1) A. DZY Loves Physics 智力题
- CodeForces 444C. DZY Loves Physics(枚举+水题)
- 【CodeForces】444A - DZY Loves Physics(图论规律)
- CodeForces 444C. DZY Loves Physics(枚举+水题)
- Codeforces Round #254 (Div. 2)C DZY Loves Physics(图论结论题)
- 【HDU5646 BestCoder Round 76 (div1)A】【贪心】DZY Loves Partition n个数拆分k个最大乘积
- 【权值分块】bzoj3570 DZY Loves Physics I
- Codeforces Round #254 (Div. 2) C. DZY Loves Physics
- Codeforces Round #254 (Div. 2) B (445B)DZY Loves Chemistry
- Codeforces Round #254 (Div. 1) -- C. DZY Loves Colors(分块)
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences 动态规划
- 【HDU5648 BestCoder Round 76 (div1)C】【打表or数位DP】DZY Loves Math nm范围内i和j i或j的gcd之和
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences
- 【BZOJ】【P3570】【DZY Loves Physics I】【题解】【树状数组】
- codeforces - 444c DZY Loves Physics【水】
- BZOJ3570: DZY Loves Physics I
- Codeforces444A_DZY Loves Physics