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

Polay部分最高复杂度为O(P),有X组数据，所以总复杂度为O(XP)，还能怎样优化？

Posted by JiangLY at 2005-07-25 18:52:07 on Problem 2154
In Reply To:是O(XP)的Polya Posted by:JiangLY at 2005-07-25 18:48:08

Followed by:

是O(ps)吧 (0) frkstyc 2005-07-25 18:53:14
- 为什么？ (0) JiangLY 2005-07-25 18:55:53
  - lrj书上写的 (0) frkstyc 2005-07-25 18:57:04
    - 我是说这道题，我从N^2优化到P，不行了…… (0) JiangLY 2005-07-25 18:59:45
      - 大牛帮忙~ (0) JiangLY 2005-07-25 19:06:41
        __int64 TLE int AC (0) swust20064469 2009-07-12 19:06:20
        为什么呢？我也一样，虽然效率不高。 (0) 10070709 2009-08-08 21:46:34

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