摘要：
呵呵program hehe;var n,i,j,k,l:longint; d,f,a:array[0..5000] of longint; function find(l,r:longint):longint; var mid:longint; begin if l=r then e... 阅读全文
摘要：
1798: [Ahoi2009]Seq 维护序列seqTime Limit:30 SecMemory Limit:64 MBSubmit:3349Solved:1241[Submit][Status][Discuss]Description老师交给小可可一个维护数列的任务，现在小可可希望你来帮他完成... 阅读全文