poj
小纪萱苏
这个作者很懒,什么都没留下…
展开
-
poj 1201 Intervals
描述 You are given n closed, integer intervals [ai, bi] and n integers c1, …, cn. Write a program that: reads the number of intervals, their end points and integers c1, …, cn from the standard input原创 2015-11-25 16:36:09 · 266 阅读 · 0 评论 -
poj 3162 Walking Race
Description flymouse’s sister wc is very capable at sports and her favorite event is walking race. Chasing after the championship in an important competition, she comes to a training center to at原创 2016-08-18 15:46:45 · 317 阅读 · 0 评论 -
POJ 1741 Tree
Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give an integer k,for every pair (u,v) o原创 2016-08-17 11:16:03 · 193 阅读 · 0 评论 -
POJ 2778 DNA Sequence (AC 自动机+矩阵)
DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15064 Accepted: 5806 Description It's well known that DNA Sequence is a sequence only contains原创 2016-08-04 21:22:48 · 206 阅读 · 0 评论 -
poj 2486 apple tree(树形DP)
Description Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip原创 2016-08-15 19:51:28 · 428 阅读 · 0 评论 -
poj 2002 Square
Squares Time Limit: 3500MS Memory Limit: 65536K Total Submissions: 18509 Accepted: 7131 Description A square is a 4-sided polygon whose sides have equal length and ad原创 2016-05-07 11:31:45 · 448 阅读 · 0 评论 -
poj 3254 Corn Fields
Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 11000 Accepted: 5773 Description Farmer John has purchased a lush new rectangular pasture compo原创 2016-01-29 16:08:37 · 180 阅读 · 0 评论 -
poj 1185 炮兵阵地
炮兵阵地 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22810 Accepted: 8830 Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能原创 2016-01-28 12:17:33 · 259 阅读 · 0 评论 -
poj 2991crane
Crane Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 4814 Accepted: 1294 Special Judge Description ACM has bought a new crane (crane -- jeřáb) . The c原创 2016-01-24 20:07:35 · 329 阅读 · 0 评论 -
oj 1018 放苹果
Description 把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。 Input 第一行是测试数据的数目t(0 Output 对输入的每组数据M和N,用一行输出相应的K。 Sample Input Raw 1 7 3 Sample Output Raw 8 思路: (原创 2015-11-29 16:49:06 · 245 阅读 · 0 评论 -
poj 3763:Slim Span
题目链接: 点击打开链接 题意:给出一个n(n 分析:根据Kruskal算法,我们可以枚举最小边权,然后求最小生成树,就可以暴力算出最大边权减去最小边权的最小值。 代码: #include #include #include #include using namespace std; #define inf 0x7f7f7f7f struct node { int st,e原创 2015-11-26 19:41:48 · 287 阅读 · 0 评论 -
poj 1155
Description A TV-network plans to broadcast an important football match. Their network of transmitters and users can be represented as a tree. The root of the tree is a transmitter that emits the foo原创 2016-08-20 10:48:34 · 243 阅读 · 0 评论