AmazingCaddy 2011-08-13 16:11 鍙戣〃璇勮
]]>AmazingCaddy 2010-06-01 01:27 鍙戣〃璇勮
]]>姣旇禌鐨勬椂鍊欒繕鏄緢瀹規(guī)槗灝辨兂鍒頒簡“綰挎鏍?紱繪暎鍖?#8221;錛岃鏄庝箣鍓嶄竴浜涚嚎孌墊爲(wèi)鐨勯鐩仛浜嗚繕鏄湁鏁堟灉鐨勩備絾鏄帴涓嬫潵灝辨槸鎮(zhèn)插墽鐨勬椂鍒伙紝娌℃湁鎯蟲竻妤氭庝箞紱繪暎鍖栵紝榪樻湁灝辨槸鏇存柊鐨勫嚱鏁幫紝鏋勯犱笉鍑烘潵錛岀煡閬?#8220;綰挎鏍?紱繪暎鍖?#8221;鍙堟湁浠涔堢敤鍛紵鍞夛紝瀵圭嚎孌墊爲(wèi)鐞嗚В鍦頒笉澶熸繁鍒葷殑銆傘傘傜敱浜庢瘮璧涗腑榪欓亾棰樼洰鐨凙C鐜囦笉楂橈紝鎴戜滑闃熻繕鏈変竴浜涘緢澶氫漢閫氳繃鐨勯娌℃湁AC錛屾垜灝辯珛椹斁寮冧簡榪欓亾棰橈紝鎯蟲渶鍚庤繕鏈夋椂闂寸殑璇濓紝鍐嶆潵鎯蟲兂銆?璺熼鎯崇殑涓鏍鳳紝姣旇禌鐨勬椂鍊欐槸娌℃湁鏃墮棿鍐嶇湅榪欓亾棰樹簡銆?br> 姣旇禌緇撴潫涔嬪悗錛岀湅鍒頒簡瑙ｉ鎶ュ憡錛屽悗鏉ュ張鍙傜湅浜?a >http://boskijr.is-programmer.com/posts/17295.html#more Boski Jr.鐨勪唬鐮侊紝鐒跺悗緇堜簬AC浜嗐?br> 瀛﹀埌浜嗕竴鎷涙瘮杈冨ソ鐨勭鏁ｅ寲鐨勬柟寮忥紝浣跨敤鍗婂紑鍗婂繀鐨勫尯闂達(dá)紝姣斿 [ a , b ] 鍙互鐢?nbsp;[ a, b+1 ) 鏉ヤ唬鏇匡紝鍙互鐪佷笅涓嶅皯絀洪棿鍛€?br> 浠ヤ笅鏄垜鐨勪唬鐮侊細(xì)
#include<iostream>#include<algorithm>#include<cmath>using namespace std;struct node 
{
int s,t; char op[3];
};struct segment{ int l,r; int left,right; // 璁板綍鍖洪棿涓ょ鐨勯珮搴?/span> int flag; // 璁板綍鏁存鍖洪棿琚笅鍘嬬殑嬈℃暟 int count; // 璁板綍鍖洪棿涓浜庨珮搴?鐨勬潯鏁?/span>};const int maxn = 21000;node a[maxn];segment tree[maxn<<3];int lisan[maxn<<1]; void make_tree( int v, int l, int r ){ int mid; tree[v].l = l, tree[v].r = r; tree[v].flag = tree[v].left = tree[v].right = 0; tree[v].count = 1; if( l + 1 != r )
{ mid = ( l + r ) >> 1; make_tree( v<<1, l, mid ); make_tree( ( v<<1 ) + 1, mid, r );
}}void update( int v, int s, int t, int c ){ int mid; if( lisan[tree[v].l] == s && lisan[tree[v].r] == t ) { tree[v].flag += c; tree[v].left += c; tree[v].right += c; if( tree[v].flag ) // 濡傛灉鍖洪棿楂樺害涓嶆槸0錛岃鏄庤涓嬪帇錛屾病鏈?綰挎 tree[v].count = 0; else // 鍙跺瓙鑺傜偣 if( tree[v].l + 1 == tree[v].r ) tree[v].count = 1; else // 涓鑸妭鐐?/span> tree[v].count = tree[v<<1].count + tree[(v<<1)+1].count - ( tree[v<<1].right == 0 && tree[(v<<1)+1].left == 0 ); return ; } mid = ( tree[v].l + tree[v].r ) >> 1; if( lisan[mid] >= t ) update( v<<1, s, t, c ); else if( lisan[mid] <= s ) update( (v<<1)+1, s, t, c ); else { update( v<<1, s, lisan[mid], c ); update( (v<<1)+1, lisan[mid], t, c ); } tree[v].left = tree[v<<1].left + tree[v].flag; tree[v].right = tree[(v<<1)+1].right + tree[v].flag; if( tree[v].flag ) tree[v].count = 0; else tree[v].count = tree[v<<1].count + tree[(v<<1)+1].count - ( tree[v<<1].right == 0 && tree[(v<<1)+1].left == 0 );}void init( int n, int m ){ int i,len=0; lisan[len++] = 0; lisan[len++] = n; for( i = 0; i < m; i++ ) { scanf("%s%d%d",a[i].op,&a[i].s,&a[i].t); a[i].t++; lisan[len++] = a[i].s; lisan[len++] = a[i].t; } sort( lisan, lisan + len ); len = unique( lisan, lisan + len ) - lisan; make_tree( 1, 0, len-1 );}int main( ){ int i,t,n,m,k = 1; scanf("%d",&t); while( t-- ) { scanf("%d%d",&n,&m); init( n, m ); printf("Case #%d:\n",k++); for( i = 0; i < m; i++ ) { update( 1, a[i].s, a[i].t, ( a[i].op[0] == 'p' ? 1 : -1 ) ); printf("%d\n",tree[1].count); } } return 0;}AmazingCaddy 2010-04-25 10:46 鍙戣〃璇勮
]]>AmazingCaddy 2010-03-10 23:06 鍙戣〃璇勮
]]>AmazingCaddy 2010-03-10 23:03 鍙戣〃璇勮
]]>AmazingCaddy 2010-03-10 17:08 鍙戣〃璇勮
]]>