- 博客(1)
- 资源 (2)
- 收藏
- 关注
原创 并查集_POJ 1182_食物链
POJ 上的并查集经典题目 食物链 #include #include #define N 50000 using namespace std; int p[N]; int d[N]; void make_set(int n) { for (int i = 0; i <= n; i++) { p[i] = i; d[i] = 0
2016-01-14 16:52:03
236
北大POJ部分题目答案(一些基础题目)
很多的POJ题目答案!1000~1008,1011~1014,1016,1017,1019,1028,1032,1045,1046,1047,1050,1061,1067,1068,1088,1102,1159,1163,1183,1207,1218,1226,1247,1256,1258,1298,1316,1323,1326,1338,1363,1396,1401,1423,1455,1458,1468,1477,1488,1503,1504,1517,1519,1528,1543,1547,1552,1265,1579,1604,1629,1656,1657,1658,1663,1664,1665,1674,1799,1844,1862,1922,1953,1969,1979,2000,2013,2017,2027,2039,2070,2080,2105,2109,2136,2140,2141,2159,2190,2196,2242,2247,2249,2262,2301,2309,2328,2350,2386,2388,2389,2390,2403,2405,2453,2479,2487,2498,2509,2521,2533,2538,2551,2562,2575,2578,2583,2591,2593,2601,2602,2608,2636,2663,2707,2719,2739,2801,2840,2871,2909,2924,3006,3030,3062,3077,3085,3094,3100,3173,3176,3210,3224,3302,3325,3438,3673,3036,2503,1731,2503,1065,3636
2014-05-05
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人