2011年1月24日

POJ 2560 Freckles 最小生成树 Kruskal+并查集使用
摘要： http://poj.org/problem?id=2560本题跟其他题差不多，只不过节点的权重需要自己计算FrecklesTime Limit:1000MSMemory Limit:65536KDescriptionIn an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so 阅读全文
posted @ 2011-01-24 20:45 yming0221 阅读(162) 评论(0) 推荐(0)
memset使用注意事项
摘要： Linux下的原型声明NAME memset - fill memory with a constant byteSYNOPSIS #include <string.h> void *memset(void *s, int c, size_t n);DESCRIPTION The memset() function fills the first n bytes of the memory area pointed to by s with the constant byte c.RETURN VALUE The memset() function returns a ... 阅读全文
posted @ 2011-01-24 11:47 yming0221 阅读(240) 评论(1) 推荐(0)
POJ 2533 Longest Ordered Subsequence 典型LIS
摘要： http://poj.org/problem?id=2533Longest Ordered SubsequenceTime Limit:2000MSMemory Limit:65536KDescriptionA numeric sequence ofaiis ordered ifa1<a2< ... <aN. Let the subsequence of the given numeric sequence (a1,a2, ...,aN) be any sequence (ai1,ai2, ...,aiK), where 1 <=i1<i2< ... < 阅读全文
posted @ 2011-01-24 10:41 yming0221 阅读(95) 评论(0) 推荐(0)

导航