Codeforces Round #279 (Div. 2) F. Treeland Tour（lis dfs）_html/css_WEB-ITnose

Question link:

huangjing

Question meaning: Tell an undirected acyclic graph, and then find the lis on the road.

Idea: Enumerate the points to find lis. The complexity is n^2logn. It seems that this complexity is a bit mysterious for time. It is estimated that the data is a bit weak. . .

First enumerate the points, and then find lis, mainly using dfs. The idea of ​​backtracking is used. I think as long as it is updated, the operation must be saved, and then once the search is completed this time, Then the value of the g array must be restored immediately, because there are many different routes, so after one path is completed, the previous state must be restored to avoid affecting the other path. . I think even though they all say it’s violence, I think this question is pretty good. . .

Title:

F. Treeland Tour

time limit per test

memory limit per test

input

output

The "Road Accident" band is planning an unprecedented tour around Treeland. The RA fans are looking forward to the event and making bets on how many concerts their favorite group will have.

Treeland consists of n cities, some pairs of cities are connected by bidirectional roads. Overall the country has n?-?1 roads. We know that it is possible to get to any city from any other one. The cities are numbered by integers from 1 to n. For every city we know its valueri ? the number of people in it.

We know that the band will travel along some path, having concerts in some cities along the path. The band's path will not pass one city twice, each time they move to the city that hasn't been previously visited. Thus, the musicians will travel along some path (without visiting any city twice) and in some (not necessarily all) cities along the way they will have concerts.

The band plans to gather all the big stadiums and concert halls during the tour, so every time they will perform in a city which population is larger than the population of the previously visited with concert city. In other words, the sequence of population in the cities where the concerts will be held is strictly increasing.

In a recent interview with the leader of the "road accident " band promised to the fans that the band will give concert in the largest possible number of cities! Thus the band will travel along some chain of cities of Treeland and have concerts in some of these cities, so that the population number will increase, and the number of concerts will be the largest possible.

The fans of Treeland are frantically trying to figure out how many concerts the group will have in Treeland. Looks like they can't manage without some help from a real programmer ! Help the fans find the sought number of concerts.

Input

The first line of the input contains integer n (2?≤?n?≤?6000) ? the number of cities in Treeland. The next line contains n integersr1,?r2,?...,?rn (1?≤?ri?≤?106), where ri is the population of the i-th city. The next n?-?1 lines contain the descriptions of the roads, one road per line. Each road is defined by a pair of integers aj, bj (1?≤?aj,?bj?≤?n) ? the pair of the numbers of the cities that are connected by thej-th road. All numbers in the lines are separated by spaces.

Output

Print the number of cities where the " Road Accident" band will have concerts.

Sample test(s)

input

61 2 3 4 5 11 22 33 43 53 6

output

input

51 2 3 4 51 21 32 43 5

output

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<map>#include<vector>#include<cmath>#include<string>#include<queue>#define eps 1e-9#define ll long long#define INF 0x3f3f3f3fusing namespace std;priority_queue<int,vector<int>,greater<int> >Q;const int maxn=6000+10;struct Egde{    int next,to;}edge[maxn<<1];int g[maxn],val[maxn],head[maxn],cnt,n,ans,top;void add_edge(int x,int y){    edge[++cnt].to=y;    edge[cnt].next=head[x];    head[x]=cnt;}void dfs(int u,int top=0,int fa=0){     int tmp,pos;     if(top==0||val[u]>g[top])     {         pos=++top;         tmp=g[top];         g[top]=val[u];         ans=max(ans,top);     }     else     {         pos=lower_bound(g+1,g+1+top,val[u])-g;         tmp=g[pos];         g[pos]=val[u];     }     for(int i=head[u];~i;i=edge[i].next)     {         int v=edge[i].to;         if(v!=fa)            dfs(v,top,u);     }     g[pos]=tmp;}int main(){    int x,y;    while(~scanf("%d",&n))    {        ans=cnt=0;        memset(head,-1,sizeof(head));        memset(g,-1,sizeof(g));        for(int i=1;i<=n;i++)            scanf("%d",&val[i]);        for(int i=1;i<=n-1;i++)        {            scanf("%d%d",&x,&y);            add_edge(x,y);            add_edge(y,x);        }        for(int i=1;i<=n;i++)            dfs(i);        printf("%d\n",ans);    }    return 0;}