 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
用动态规划的思路我的不用搜索呵呵.先用结构体将每个山峰高度对应的坐标(X,Y)记录,然后用快速排序,按照高度从小到大排好. 然后DP,所有山峰对应的最长路线初始为1,然后for循环从山峰高度最小到最大,查看每个山峰四周的山峰,找到高度比自己低并且最长路线最大的,加到自己身上.循环结束后再检验一遍,看哪个最大,输出就好. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
