beibaotu.com/travel_notes/0hbhi6
beibaotu.com/travel_notes/0hbhe1
beibaotu.com/travel_notes/0hbhuc
beibaotu.com/travel_notes/0hbhco
beibaotu.com/travel_notes/0hbhml
beibaotu.com/travel_notes/0hbh...
分类:
其他好文 时间:
2015-05-19 22:44:12
阅读次数:
117
beibaotu.com/travel_notes/0hv6st
beibaotu.com/travel_notes/0hv6sx
beibaotu.com/travel_notes/0hv6xl
beibaotu.com/travel_notes/0hv6vc
beibaotu.com/travel_notes/0hv6ro
beibaotu.com/travel_notes/0hv6...
分类:
其他好文 时间:
2015-05-19 22:41:58
阅读次数:
87
Travelling FeeTime Limit:2 Seconds Memory Limit:65536 KBSamball is going to travel in the coming vacation. Now it's time to make a plan. After choosin...
分类:
其他好文 时间:
2015-05-18 12:41:29
阅读次数:
147
问题描述在使用Android studio引入第三方jar包,打包时出错
Error:duplicate files during packaging of APK F:\Travel\app\build\outputs\apk\app-debug-unaligned.apk
Path in archive: META-INF/NOTICE.txt
Origin 1: F:\...
分类:
其他好文 时间:
2015-05-12 23:11:58
阅读次数:
237
Strange Country II
You want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is taking planes. Strangely,
in t...
分类:
其他好文 时间:
2015-05-04 22:13:34
阅读次数:
111
题意:
给你n个城市m天。
每个城市有到达的花费 c[i][j] 代表城市i到城市j的花费 本身到本身也有花费 就相当于住宿费吧。
接着每天在每个城市都能赚钱 p[m][n] 代表每天每个城市赚的前。
问m天后最多能赚多少钱。
思路:
比较水的dp吧。
dp[i][j] 代表第i天在j城市 最多赚了多少钱。
起点在1,所以dp[0][1]=0
然后三重循环dp就好了·
注意赚...
分类:
其他好文 时间:
2015-04-29 09:55:33
阅读次数:
127
主要讲的各个基本类型,integer,float,list,tuple,dic, list method:append,insert,extend, index tuple:no method ,can not change it,bu we can use the index to travel across dic: create a dic by using di...
分类:
编程语言 时间:
2015-04-27 13:24:59
阅读次数:
168
14181. Flying Safely
Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
Due to budget cuts, even spies have to use commercial airlines nowadays to travel between cities...
分类:
其他好文 时间:
2015-04-27 10:00:29
阅读次数:
195