2009 年 5月 2 日随笔档案 - pandy

2009年5月2日

摘要：题目描述 We get lost again , we can not find our friends...But luckly , we have mobile phone.They are moving by group,and we know our friend in the same group can connect with each other in directly or in... 阅读全文

posted @ 2009-05-02 01:12 pandy 阅读(722) 评论(1) 推荐(0) 编辑

Just for fun----zjfc 并查集操作

摘要：题目描述When I boring , I'm crazy...So I design a BT game just for fun...It's easy...输入描述 First line is a interger T <=20 ;T case follow ,each case begin with the interger N(N<=100000) , as the max ... 阅读全文

posted @ 2009-05-02 01:04 pandy 阅读(325) 评论(0) 推荐(0) 编辑

I won't tell you this is about graph theory----zjfc bellman-ford算法与spfa算法

摘要：题目描述 To think of a beautiful problem description is so hard for me that let's just drop them off. :)Now we have the path from one point to another(directly), and the weight we cost.Tell me the min wei... 阅读全文

posted @ 2009-05-02 00:42 pandy 阅读(713) 评论(0) 推荐(0) 编辑

Flood---ZJFC Weekly - 5

摘要：题目描述 The Flood come from the border of the map, so tell me the area without flood...Do u think it's easy ? 输入描述 First T("#"）,最后统计地图中"."的个数并是结果了代码如下： Code Code highlighting produced by A... 阅读全文

posted @ 2009-05-02 00:24 pandy 阅读(142) 评论(0) 推荐(0) 编辑