DFS
路过雨天
试试
展开
-
HDU 1312
Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12972 Accepted Submission(s): 8019 Problem Description There is a rect原创 2015-08-02 09:51:10 · 396 阅读 · 0 评论 -
油田统计
Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid原创 2015-08-02 12:03:18 · 821 阅读 · 0 评论 -
NYOJ 20
吝啬的国度 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。 输入第一行输入一个整数M表示测试数据共有M(1 每组测试数据原创 2015-07-24 17:44:50 · 383 阅读 · 0 评论