2010年12月9日

POJ 1847 Floyd应用
摘要： 当初把Floyd算法的最外层循环写到最里层了，囧～～～～#include<stdio.h> #define MAX 1000000 int opt[102][102]; int vertexnum; void Floyd() { int _i,_j,_k; for(_j=1;_j<=vertexnum;_j++) for(_k=1;_k<=vertexnum;_k++) for(_i=1;_i<=vertexnum;_i++) { if(opt[_i][_k]+opt[_k][_j]... 阅读全文
posted @ 2010-12-09 22:06 yming0221 阅读(94) 评论(0) 推荐(0)
POJ 2181Jumping Cows 动态规划DP
摘要： Jumping CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4477Accepted:2705DescriptionFarmer John's cows would like to jump over the moon, just like the cows in their favorite nursery rhyme. Unfortunately, cows can not jump.The local witch doctor has mixed up P (1 <= P <= 150,000) 阅读全文
posted @ 2010-12-09 11:12 yming0221 阅读(137) 评论(0) 推荐(0)

导航