Detail of message

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

这道题目比赛的时候是用DP过的，不知道用图论方法是怎么实现的？

Posted by huicpc21 at 2006-09-30 10:00:17 on Problem 3018

Followed by:

没啥差别吧，本质上应该是一样的.. (0) wywcgs 2006-09-30 10:05:01
bellman-ford求最长路 (0) frkstycFans 2006-09-30 10:16:12
- 汗 (0) sunmoonstar 2006-09-30 10:26:29
- 这是dag..... (0) wywcgs 2006-09-30 10:26:35
  - 对！！ (0) frkstycfans 2006-09-30 10:48:27
    - -_- (0) wywcgs 2006-09-30 10:52:03
Re:这道题目比赛的时候是用DP过的，不知道用图论方法是怎么实现的？ (28) busycai 2006-10-03 16:37:51
- 直接排序之后，就类似于经典DP模型－找最长递增子序列了。 (32) busycai 2006-10-03 16:38:33

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator