摘要:
第一问二分答案第二问dp需优化空间和时间坑了一天 才写出个坑爹坑爹程序program hehe;const q=10007;var ans,s,min,max,n,m,i,j,k,l,t:longint; sum,h:array[0..50000] of longint; d:array[0..50... 阅读全文
摘要:
线段树模版1690 开关灯 1 program hehe; 2 type 3 tree=record 4 l,r,h,s:longint; 5 end; 6 var 7 n,m,i,j,k,f:longint; 8 x:array[0..1000000] of tree; 9 10 ... 阅读全文