| ||||||||||
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 |
WA,,我说说我的想法,大家帮我看看算法对不对,好吗?In Reply To:这题和Ugly number 不是同个道理吗? Posted by:Essence_me at 2005-09-18 13:50:54 先把M个序列排序 用FLAG[M]指向序列头 第一个SUM肯定是每列第一个数字之和, 接着比较每列FLAG指向的数和下一个数的差,选取最小的,然后那一列的FLAG++; 这样一直到得到N个最小SUM序列 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator