摘要: 树状数组解决lis(最长上升序列),nlogn用树状数组维护f数组小于等于i的最大值(前i位最值)用到离散化View Code 1 program sky; 2 var 3 c,a,f,b,s:array[0..50000] of longint; 4 i,j,n:longint; 5 ans,tot:longint; 6 function max(qq,ww:longint):longint; 7 begin 8 if qq>ww then exit(qq); exit(ww); 9 end;10 procedure swap(var qq,ww:longint);11 v... 阅读全文
posted @ 2012-04-13 06:35 SunSky... 阅读(220) 评论(0) 推荐(0) 编辑