https://blog.youkuaiyun.com/QzNarshzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/QzNarsh/article/details/52189937https://blog.youkuaiyun.com/QzNarsh/article/details/52189937QzNarshFri, 12 Aug 2016 11:10:04 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52189064https://blog.youkuaiyun.com/QzNarsh/article/details/52189064QzNarshFri, 12 Aug 2016 10:03:40 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52188907https://blog.youkuaiyun.com/QzNarsh/article/details/52188907QzNarshFri, 12 Aug 2016 09:48:57 +0800 File Name: UVA-193.cpp >]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52188764https://blog.youkuaiyun.com/QzNarsh/article/details/52188764QzNarshFri, 12 Aug 2016 09:34:53 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049780https://blog.youkuaiyun.com/QzNarsh/article/details/52049780QzNarshWed, 27 Jul 2016 21:45:20 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049635https://blog.youkuaiyun.com/QzNarsh/article/details/52049635QzNarshWed, 27 Jul 2016 21:28:08 +0800 File Name: UVA-167.cpp > Author: Narsh >]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52049467https://blog.youkuaiyun.com/QzNarsh/article/details/52049467QzNarshWed, 27 Jul 2016 21:09:34 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049404https://blog.youkuaiyun.com/QzNarsh/article/details/52049404QzNarshWed, 27 Jul 2016 21:01:19 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049335https://blog.youkuaiyun.com/QzNarsh/article/details/52049335QzNarshWed, 27 Jul 2016 20:50:39 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049301https://blog.youkuaiyun.com/QzNarsh/article/details/52049301QzNarshWed, 27 Jul 2016 20:46:27 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049261https://blog.youkuaiyun.com/QzNarsh/article/details/52049261QzNarshWed, 27 Jul 2016 20:42:00 +08001->2->……>n，每个人每坐到下一个城市需要1个花费，求车子最多能获得多少钱。 解题思路：枚举每个订单接不接，起始站的num[star]+= order_number[i]; 终点站 num[end]-=order_number[i]。然后从0开始一路累加num[i]，到城市i，前]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52049203https://blog.youkuaiyun.com/QzNarsh/article/details/52049203QzNarshWed, 27 Jul 2016 20:34:29 +0800 Fi]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52049167https://blog.youkuaiyun.com/QzNarsh/article/details/52049167QzNarshWed, 27 Jul 2016 20:29:12 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52049122https://blog.youkuaiyun.com/QzNarsh/article/details/52049122QzNarshWed, 27 Jul 2016 20:23:52 +0800 File Name: UVA-216.cpp >]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52039870https://blog.youkuaiyun.com/QzNarsh/article/details/52039870QzNarshTue, 26 Jul 2016 21:35:13 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52039774https://blog.youkuaiyun.com/QzNarsh/article/details/52039774QzNarshTue, 26 Jul 2016 21:24:13 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52039716https://blog.youkuaiyun.com/QzNarsh/article/details/52039716QzNarshTue, 26 Jul 2016 21:16:41 +0800https://blog.youkuaiyun.com/QzNarsh/article/details/52039648https://blog.youkuaiyun.com/QzNarsh/article/details/52039648QzNarshTue, 26 Jul 2016 21:08:52 +0800= s[i+1]的位置，用i+1到end中比s[i]大的中最小的那个替换s[i]，剩下的i+1到end的字母从小到大排序。/************************************************************************* > File]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52039598https://blog.youkuaiyun.com/QzNarsh/article/details/52039598QzNarshTue, 26 Jul 2016 21:02:25 +0800四条（四张相同的牌，炸弹 = =） > 福尔豪斯 （aaabb的牌型) > 同花（5张花色相同） > 顺子 （连续，无视花色。A可以当1也可以当14）> 三条 （aaabc]]>https://blog.youkuaiyun.com/QzNarsh/article/details/52004999https://blog.youkuaiyun.com/QzNarsh/article/details/52004999QzNarshSat, 23 Jul 2016 16:17:02 +0800 File Name: 07]]>