2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 H. Skiing(记忆化dfs)
来源:互联网 发布:数据库漏洞 编辑:程序博客网 时间:2024/04/28 21:44
In this winter holiday, Bob has a plan for skiing at the mountain resort.
This ski resort has M different ski paths and Ndifferent flags situated at those turning points.
The i-th path from the Si-th flag to the Ti-th flag has length Li.
Each path must follow the principal of reduction of heights and the start point must be higher than the end point strictly.
An available ski trail would start from a flag, passing through several flags along the paths, and end at another flag.
Now, you should help Bob find the longest available ski trail in the ski resort.
Input Format
The first line contains an integer T, indicating that there are T cases.
In each test case, the first line contains two integers N and M where 0<N≤10000and 0<M≤100000 as described above.
Each of the following M lines contains three integers Si, Ti, and Li (0<Li<1000)describing a path in the ski resort.
Output Format
For each test case, ouput one integer representing the length of the longest ski trail.
样例输入
15 41 3 32 3 43 4 13 5 2
样例输出
6
题解:
这一题是我a出来的第二个题目,一开始用bfs搜爆了内存,改进了TLE,然后就用dfs尝试了下居然过了。。。不知道别人怎么写的
代码:
#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<vector>#include<deque>#include<algorithm>using namespace std;#define INF 100861111#define eps 1e-7#define lson k*2#define rson k*2+1#define ll long longstruct edge{ int to;//该边通往的点 int len;}a[100005];int p[10005][105];//存第i个点连接的第j条边是哪个int num[10005];//存第i个点连接的边的数目int r[10005];//存入度数目int vis[10005];//存遍历情况int dfs(int tar)//tar为当前点下标{ if(vis[tar])//如果已经遍历过了,直接返回已经保存的最大值 { return vis[tar]; } int i; int maxx=0; for(i=0;i<num[tar];i++) { maxx=max(maxx,dfs(a[p[tar][i]].to)+a[p[tar][i]].len);//更新该点之后能遍历的最长长度 } vis[tar]=maxx;//保存 return maxx;//返回该最大值}int main(){ int i,j,k,n,m,test,x,y,d; scanf("%d",&test); while(test--) { scanf("%d%d",&n,&m); for(i=1;i<=n;i++) { num[i]=0; r[i]=0; vis[i]=0; } for(i=0;i<m;i++) { scanf("%d%d%d",&x,&y,&d); a[i].len=d; a[i].to=y; p[x][num[x]]=i; num[x]++; r[y]++; } int maxx=0; for(i=1;i<=n;i++) { if(r[i]==0)//从入度为0的点开始找 { maxx=max(maxx,dfs(i));//更新最大值 } } printf("%d\n",maxx); } return 0;}
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 H. Skiing(记忆化dfs)
- H. Skiing 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 H. Skiing
- 计蒜客-2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛-H-Skiing
- 计蒜客 16957 Skiing(2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 H)
- 【2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 】H Skiing 【求DAG图的最长路】
- Skiing( 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 )
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛-H Skiing
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区) 网络赛 H.Skiing(求有向无环图的最长路)
- 计蒜客-2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛H题Skiing(拓扑序求DAG最长路)
- where和having的区别
- php的filter扩展小技巧
- JS中JSON对象
- 【Java基础】总结java将字符串反转的7个方法
- Hadoop在Unbunt环境下的伪分布模式搭建教程
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 H. Skiing(记忆化dfs)
- 如何利用热播电视剧关键词引流?
- IDE中使用Console出现NullPointerException错误
- LeetCode65. Valid Number
- Banana
- Adobe flash player白利用远控分析
- jQuery中动画animate(上)
- SQL基础之select
- bzoj1370 团伙 【并查集】