图论_拓扑排序
Chook_lxk
你前程有在,但须澄心猛省,不可自甘堕落。
展开
-
HDU - 2647 Reward(拓扑排序+邻接表)
点击打开题目链接 Reward Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8688Accepted Submission(s): 2785 Problem Description Dande原创 2017-04-25 23:14:42 · 748 阅读 · 0 评论 -
HDU - 1285 确定比赛名次(拓扑排序)
点击打开题目链接 确定比赛名次 Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25373Accepted Submission(s): 10181 Problem Description 有原创 2017-04-22 22:46:27 · 954 阅读 · 0 评论 -
HDU - 3342 Legal or not(拓扑排序判断成环)
点击打开题目链接 Legal or Not Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8213 Accepted Submission(s): 3862Problem Description ACM-DIY is a原创 2017-04-26 22:20:00 · 762 阅读 · 0 评论 -
HDU - 1811 Rank of Tetris(并查集+拓扑排序)
点击打开题目链接 Rank of Tetris Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10316Accepted Submission(s): 2949 Problem Description原创 2017-08-22 20:34:49 · 306 阅读 · 0 评论 -
UVA - 1572 Self-Assembly(拓扑排序判断成环)
点击打开题目链接 有n种边上带标号的正方形,每种无穷多个,特定标号可以相连,判断是否能够组成无限大空间结构。 标号做点,正方形作边,构建有向图,拓扑排序判断是否成环即可。 代码: #include<bits/stdc++.h> using namespace std; const int maxn = 52; int n; string s; int vis[maxn];...原创 2018-02-10 18:01:37 · 301 阅读 · 0 评论