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

做到O(n)不需要技巧,做到nlogn还是要一点的

Posted by xfxyjwf at 2005-08-15 23:57:36 on Problem 1868
In Reply To:的确没有任何技巧嘛 Posted by:frkstyc at 2005-08-15 23:56:10

Followed by:

n(1/1+1/2+1/3+...+1/n)=O(nlogn)，所以两重循环OK (0) frkstyc 2005-08-16 00:01:57
- 没看懂 (23) xfxyjwf 2005-08-16 00:10:55
  - 你快去切了这个题，用不了多少时间 (27) frkstyc 2005-08-16 00:12:14
    - 不是已经说了不能打数字了么?怎么切? (0) xfxyjwf 2005-08-16 00:13:58
      - 刚才不给你打了一份么，copy-paste!!! (0) frkstyc 2005-08-16 00:14:51
        那得花不少时间...还有括号什么的,都得一点点paste... (0) xfxyjwf 2005-08-16 00:15:41
        ()[]{}&%，符号齐了，go (0) frkstyc 2005-08-16 00:16:49
      - 况且我整个程序只用了7个0，两个1，1个2 (0) frkstyc 2005-08-16 00:16:02
        ......你只用字母键和鼠标写一个程序试试? (0) xfxyjwf 2005-08-16 00:17:42
        你就不用word的find-replace搞 (0) frkstyc 2005-08-16 00:18:43

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