hdu 2680 Choose the best route 大年三十的首A 赤裸裸的Dijkstr Home » 编程开发 » hdu 2680 Choose the best route 大年三十的首A 赤裸裸的Dijkstr Choose the best routeTime Limit: 2000/1000 MS (Java/Oth … 阅读更多
Circle (后缀数组) Home » 编程开发 » Circle (后缀数组) Description Here is a circle sequence S of length n, an … 阅读更多
light OJ 1027 A Dangerous Maze (期望) Home » 编程开发 » light OJ 1027 A Dangerous Maze (期望) 1027 – A Dangerous Maze Time Limit:2 second(s)Mem … 阅读更多
Choose and divide (组合数) Home » 编程开发 » Choose and divide (组合数) 题目传送:UVA – 10375 思路:用double存答案,不过要注意是边乘边除,这样不会爆do … 阅读更多
FZU OJ 2111 Min Number (贪心) Home » 编程开发 » FZU OJ 2111 Min Number (贪心) Now you are given one non-negative integer n in 10-base … 阅读更多
HDU 2680 Choose the best route SPFA算法+反向建图 Home » 编程开发 » HDU 2680 Choose the best route SPFA算法+反向建图 Choose the best route Time Limit: 2000/1000 MS (Java/Ot … 阅读更多