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 |
此题没有太大的技巧,就是图搜索,每次找颜色值最大的且全部相等的行或列(被消除的可以认为为任意值),存入堆栈,找到头完了,然后把堆栈输出Rt,也可以理解为拓扑排序,其实就是贪心。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator