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

A:不用dp，直接枚举每个人贪心向2边赢，用栈存，有反例没？

Posted by lympanda at 2005-02-27 17:19:55
In Reply To:有没有人想讨论一下？ Posted by:Maximum at 2005-02-27 17:01:17

Followed by:

A是这样的： (0) tn 2005-02-27 17:20:42
- 如果有一种或三种就是n,如果有两种就是强的那种的数量 (0) TN 2005-02-27 17:21:26
  - 哦，对对，我想错了。。。。。。ft (0) lympanda 2005-02-27 17:24:19
    - 这题让我吐血不已......一开始写了好长的代码，又是wa,又是tle,后来出门逛了一圈，突然有了想法...... (0) TN 2005-02-27 17:26:08
O(n^3)的加小优化都能过。 (0) Maximum 2005-02-27 17:32:26

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