 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:为便于理解,给组反例,详见内.In Reply To:为便于理解,给组反例,详见内. Posted by:ferret_chao at 2005-10-12 12:28:54 这种方案可以吧。用两个数组变量来存放权重: int left[12],right[12]. "even"时就对两个都操作。"up", 左边出现的字符i在对应的left[i]进行+1 ， 右边的字符j在对应的right[j]进行+1. 最后比较两数组中得到最大的，顺便判断轻重。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
