- 博客(6)
- 收藏
- 关注
RSS订阅原创 Optimal Milking POJ - 2112
FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milking machines. The milkin
2017-04-28 01:50:48
738
原创 PIGS POJ - 1149
Mirko works on a pig farm that consists of M locked pig-houses and Mirko can’t unlock any pighouse because he doesn’t have the keys. Customers come to the farm one after another. Each of them has keys
2017-04-28 01:42:56
314
原创 Drainage Ditches POJ - 1273
Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Far
2017-04-28 01:33:57
324
原创 Codeforces 427 C. Checkposts
Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions.To ensure the security, you have to build some p
2017-04-27 00:48:42
542
原创 shu_mj 的数据结构专场（二）
Problem A: 求个和 （shuoj1883）Description 给你一个长为N 的序列，M 条询问，每次问你[l, r] 区间内，所有数字的和是多少。Input 第一行包含两个整数 N, M。 第二行有 N 个整数 Ai，表示这个序列。 接下来 M 行，每行两个整数 l r，表示一个询问。0 < N, M < 1e5 -1e4 < Ai < 1e4 0 < l <= r <
2017-04-25 01:14:17
387
原创 shuoj_1559
1559: 无向图的连通分支Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 783 Solved: 451[Submit][Status][Web Board]Description输入一个无向图G，计算G的连通分支数。Input有多个无向图数据。每个无向描述的第1行是两个整数n和e，分别表示顶点数和边数。
2017-04-21 02:53:55
350
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人