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 |
这个题目很有意思.做出不难,但要很细心.查找两个位置后要注意修正下数据~~~ai=ffind(sa); if(cmp(sa,a[ai])>0) ai++; bi=ffind(sb); if(cmp(sb,a[bi])<0) bi--; cout<<bi-ai+1<<endl; Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator