CodeForces 444A DZY Loves Physics（结论题）

题意：给你一个带边权和带点权的无向图，你需要找到一个最大的子团，使得这个子团的点权和除以边权和最

思路：直接猜一波一定是只能选两个点，然后就可以了

#include<bits\stdc++.h>
using namespace std;
const int maxn = 505;
double v[maxn];
int n,m;
double ans;
int main()
{
     scanf("%d%d",&n,&m);
	 for (int i = 1;i<=n;i++)
		 scanf("%lf",&v[i]);
	 for (int i = 1;i<=m;i++)
	 {
		 int a,b;
		 double c;
		 scanf("%d%d%lf",&a,&b,&c);
		 ans = max(ans,(v[a]+v[b])/c);
	 }
	 printf("%.15lf\n",ans);
}

Description

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 x_i (1 ≤ x_i ≤ 10⁶), where x_i 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 a_i, b_i, c_i (1 ≤ a_i < b_i ≤ n; 1 ≤ c_i ≤ 10³), denoting an edge between node a_i and b_i with value c_i. 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 Input

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

Hint

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.