算法程序设计
文章平均质量分 76
CryButNoTear
这个作者很懒,什么都没留下…
展开
-
ZJU 1952 Heavy Cargo
最坏情况的输入操作次数:20000 *200 = 4,000,000为了写起来方便,直接FLOYD搞定,200^3 = 8, 000,000[CODE]#include #include const int M = 205 ;struct CITY { char name[35] ;} city[M] ;int value[M][M], nCount ;int GetCityPos原创 2006-05-17 17:53:00 · 1221 阅读 · 0 评论 -
zju 1721 The Doors
I theat this problem as a shortest path problem, And i do it as the follow steps: 1). check whether point i and point j can direct arrived or not, if can and sign the distance between i and j,else sig原创 2006-05-17 18:03:00 · 1008 阅读 · 0 评论 -
ZJU 1101 Gamblers
I had got WA many times!!useful test data:410 9 3 -2410 9 3 -4410 9 3 -16output should be 10, 9, 3 as squence.//////////////////////////////////////////////////////////////////////////////////原创 2006-05-21 01:24:00 · 1281 阅读 · 0 评论