-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathElectricity.cpp
92 lines (89 loc) · 2.09 KB
/
Electricity.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
// हर हर महादेव
#define F first
#define S second
#define dbl double
using namespace std;
#define pb push_back
#define vin(name, size) \
for (i = 0; i < size; i++) \
cin >> name[i]
#define vout(name) \
for (i = 0; i < name.size(); i++) \
cout << name[i] << " "; \
cout << endl
#define vvin(name, rowss, colmn) \
for (i = 0; i < rowss; i++) \
{ \
for (j = 0; j < colmn, j++) \
cin >> name[i][j]; \
}
#define vvout(name, rowss, colmn) \
for (i = 0; i < rowss; i++) \
{ \
for (j = 0; j < colmn, j++) \
cout << name[i][j] << " "; \
cout << endl; \
}
#include <bits/stdc++.h>
#define ll long long int
// ll dream[];
#define all(x) x.begin(), x.end()
#define mem memset(dream, -1, sizeof(dream))
#define Pi 3.1415926535897932384626
#define deb(v) cout << #v << " " << v << "\n"
#define deb2(v, k) cout << #v << " " << v << "\n" \
<< #k << " " << k << "\n"
ll dfs(vector<ll> adj[], ll node, vector<ll> &vis, vector<ll> &res)
{
vis[node] = 1;
ll p = 1;
for (auto x : adj[node])
{
if (!vis[x] && res[node] > res[x])
p += dfs(adj, x, vis, res);
}
return p;
// return p + 1;
}
void HHM()
{
// mem;
ll i, j, k;
ll n;
cin >> n;
vector<ll> v(n);
vin(v, n);
// vout(v);
vector<ll> adj[n];
for (i = 0; i < n - 1; i++)
{
ll a, b;
cin >> a >> b;
a--;
b--;
adj[a].pb(b);
adj[b].pb(a);
}
ll mx = 0;
for (i = 0; i < n; i++)
{
vector<ll> vis(n, 0);
ll cnt = 0;
mx = max(mx, dfs(adj, i, vis, v));
}
cout << mx << "\n";
return;
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
ll t = 1;
cin >> t;
for (ll i = 1; i <= t; i++)
{
cout << "Case #" << i << ": ";
HHM();
}
}
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);