解题报告 之 HDU5325 Crazy Bobo
Description
Bobo has a tree,whose vertices are conveniently labeled by 1,2,...,n.Each node has a weight
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
. All the weights are distrinct.
A set with m nodes![](https://i-blog.csdnimg.cn/blog_migrate/065a016a12368e8395ca53ed4fe778b5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/065a016a12368e8395ca53ed4fe778b5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/e3f420d38eb1b6e230fcbf29a6d432c3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/065a016a12368e8395ca53ed4fe778b5.png)
is a Bobo Set if:
- The subgraph of his tree induced by this set is connected.
- After we sort these nodes in set by their weights in ascending order,we get![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/e3f420d38eb1b6e230fcbf29a6d432c3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
,(that is,
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/8ac43a8ef94befae925fd3a25fe23e85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1df0f0b3d47824fdc79d62a2247c5db8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/3566ebe8ad15f53386887ef4dfb72d85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/8ac43a8ef94befae925fd3a25fe23e85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1df0f0b3d47824fdc79d62a2247c5db8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a4014a9fc42860007a7f9a69f6f8169a.png)
for i from 1 to m-1).For any node
in the path from
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
to
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/60c8a3eaac2a291077a199c19e1ad82a.png)
(excluding
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
and
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/60c8a3eaac2a291077a199c19e1ad82a.png)
),should satisfy
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/61fade9aad0a78d86d3208455034de85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/3566ebe8ad15f53386887ef4dfb72d85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/8ac43a8ef94befae925fd3a25fe23e85.png)
.
Your task is to find the maximum size of Bobo Set in a given tree.
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
A set with m nodes
![](https://i-blog.csdnimg.cn/blog_migrate/065a016a12368e8395ca53ed4fe778b5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/065a016a12368e8395ca53ed4fe778b5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/e3f420d38eb1b6e230fcbf29a6d432c3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/065a016a12368e8395ca53ed4fe778b5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/16e36fb55d4f733a8efe214a4e053cf0.png)
- The subgraph of his tree induced by this set is connected.
- After we sort these nodes in set by their weights in ascending order,we get
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/e3f420d38eb1b6e230fcbf29a6d432c3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/16e36fb55d4f733a8efe214a4e053cf0.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/8ac43a8ef94befae925fd3a25fe23e85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1df0f0b3d47824fdc79d62a2247c5db8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/3566ebe8ad15f53386887ef4dfb72d85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/8ac43a8ef94befae925fd3a25fe23e85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1df0f0b3d47824fdc79d62a2247c5db8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a4014a9fc42860007a7f9a69f6f8169a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/9c0ceb573a3711b67b16f3553963440b.png)
![](https://i-blog.csdnimg.cn/blog_migrate/82e20a3491b6554bca16b2e497c691bd.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/60c8a3eaac2a291077a199c19e1ad82a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1ee28dcaecf48030244ea598398259f7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/60c8a3eaac2a291077a199c19e1ad82a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/61fade9aad0a78d86d3208455034de85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/3566ebe8ad15f53386887ef4dfb72d85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/8ac43a8ef94befae925fd3a25fe23e85.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1df0f0b3d47824fdc79d62a2247c5db8.png)
Your task is to find the maximum size of Bobo Set in a given tree.
Input
The input consists of several tests. For each tests:
The first line contains a integer n (![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d145744987ffd848d7874a11151ad68e.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b503db96fe85a552479ddbd4b574df16.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
). Then following a line contains n integers
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/e3f420d38eb1b6e230fcbf29a6d432c3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
(
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
,all the
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
is distrinct).Each of the following n-1 lines contain 2 integers
![](https://i-blog.csdnimg.cn/blog_migrate/0815e7e68da82e60bdb79395822f6d97.png)
and
![](https://i-blog.csdnimg.cn/blog_migrate/6819ad02b70c45921b71f613da72f0f8.png)
,denoting an edge between vertices
![](https://i-blog.csdnimg.cn/blog_migrate/0815e7e68da82e60bdb79395822f6d97.png)
and
![](https://i-blog.csdnimg.cn/blog_migrate/6819ad02b70c45921b71f613da72f0f8.png)
(
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0815e7e68da82e60bdb79395822f6d97.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/6819ad02b70c45921b71f613da72f0f8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
).
The sum of n is not bigger than 800000.
The first line contains a integer n (
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d145744987ffd848d7874a11151ad68e.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b503db96fe85a552479ddbd4b574df16.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d9efe1ce21b2c8d4b2797ef8bce8879a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/e3f420d38eb1b6e230fcbf29a6d432c3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b7afcc7f4cf457ed54232774c358e8ae.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/43f98a79cd719cbbc21b0987c23c4b74.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/1b08ce66336b4f2b3a7b911c59c311d2.png)
![](https://i-blog.csdnimg.cn/blog_migrate/094f0c54ab74a17baaa3bd2c27e2cbb6.png)
![](https://i-blog.csdnimg.cn/blog_migrate/766c416a3ae4d7b5555398bc89a9033a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0815e7e68da82e60bdb79395822f6d97.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/6819ad02b70c45921b71f613da72f0f8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0815e7e68da82e60bdb79395822f6d97.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/6819ad02b70c45921b71f613da72f0f8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a22e580c04f29f0f25e4262eec591fd5.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0815e7e68da82e60bdb79395822f6d97.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0078e2c51675107576ccab364cd305ec.png)
![](https://i-blog.csdnimg.cn/blog_migrate/6819ad02b70c45921b71f613da72f0f8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/b6a0880b16005c45f1a99e77c70ee111.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d11c95e88ab4c8b84819401a4bd9aa72.png)
![](https://i-blog.csdnimg.cn/blog_migrate/d145744987ffd848d7874a11151ad68e.png)
The sum of n is not bigger than 800000.
Output
For each test output one line contains a integer,denoting the maximum size of Bobo Set.
Sample Input
7 3 30 350 100 200 300 400 1 2 2 3 3 4 4 5 5 6 6 7
Sample Output
5
分析:因为这个子图任意权重相邻的点都要满足这个条件,所以这个子图一定连通(否则一定存在权值相邻的点之间没有连通path)。然后注意到这个条件,这个子图任意权重相邻点之间的路要么是没有点,要么一定是呈现山谷状的,即两边最高,向中间递减。那么从图中的一个点开始,以它为最低点,向两边较高的扩展,然后再以同样的方式去搜索这两个较高点。那么任意两个权值相邻的点,往回找通路的时候一定都是呈现山谷状的。那么问题就转换成了,从某个点出发,去找到它能够扩展到的最大点数,深搜一次即可。
上代码:
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int MAXN = 5e6+10;
struct Edge
{
int to, nxt;
};
Edge edge[MAXN];
int head[MAXN];
int w[MAXN];
int num[MAXN];
int cnt, ans;
void addedge( int from, int to )
{
edge[cnt].to = to;
edge[cnt].nxt = head[from];
head[from] = cnt++;
}
int dfs( int u )
{
if(num[u]) return num[u];
num[u] = 1;
for(int i = head[u]; i != -1; i = edge[i].nxt)
{
int v = edge[i].to;
num[u]+=dfs( v );
}
return num[u];
}
int main()
{
int n;
while(scanf( "%d", &n ) == 1)
{
cnt = 0;
memset( num, 0, sizeof num );
memset( head, -1, sizeof head );
for(int i = 1; i <= n; i++)
scanf( "%d", &w[i] );
for(int i = 0; i < n - 1; i++)
{
int u, v;
scanf( "%d%d", &u, &v );
if(w[u] < w[v])
addedge( u, v );
else
addedge( v, u );
}
ans = 0;
for(int i = 1; i <= n; i++)
ans = max( ans, dfs( i ) );
cout << ans << endl;
}
return 0;
}
嗯就是这样!