锘??xml version="1.0" encoding="utf-8" standalone="yes"?>韩国一区二区三区在线观看,久久不射网站,亚洲日本欧美 http://m.shnenglu.com/hoolee/category/19668.htmlIf you believe, you can! zh-cn Sun, 24 Mar 2013 16:42:42 GMT Sun, 24 Mar 2013 16:42:42 GMT 60 zoj3157--閫嗗簭瀵?/title> http://m.shnenglu.com/hoolee/archive/2012/08/13/187070.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 13 Aug 2012 07:12:00 GMT http://m.shnenglu.com/hoolee/archive/2012/08/13/187070.html http://m.shnenglu.com/hoolee/comments/187070.html http://m.shnenglu.com/hoolee/archive/2012/08/13/187070.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/187070.html http://m.shnenglu.com/hoolee/services/trackbacks/187070.html 鐢變簬璺熷彟澶栦竴棰樺熀鏈竴鏍鳳紝榪欓噷涓嶅瑙i噴浜嗭紝璇峰弬闃咃細
http://m.shnenglu.com/hoolee/archive/2012/08/13/187069.html 浠ヤ笅鏄湰棰樹唬鐮侊細#include < stdio.h > #include< stdlib.h > #include< math.h > #define LEN 10100 typedef struct { double l; double r; }Node; typedef struct { int x0; int y0; int x1; int y1; }Line; Line lin[LEN]; Node nd[LEN]; long long count; int cmp( const void * a, const void * b) { Node * a0 = (Node * )a; Node * b0 = (Node * )b; if (fabs(a0 -> l - b0 -> l) > 0.000000001 ) return a0 -> l > b0 -> l ? 1 : - 1 ; else return a0 -> r > b0 -> r ? 1 : - 1 ; } void Merge(Node * nd, int f, int m, int r) { int i, j, k; Node * b = (Node * )malloc( sizeof (Node) * (r - f + 3 )); i = f; j = m + 1 ; k = 0 ; while (i <= m && j <= r) // merge { if (nd[i].r <= nd[j].r) { b[k ++ ] = nd[i ++ ]; if (k + f > i) count += k + f - i; } else b[k++ ] = nd[j ++ ]; } while (i <= m) { b[k ++ ] = nd[i ++ ]; if (k + f > i) count += k + f - i; } while (j <= r) b[k ++ ] = nd[j ++ ]; for (i = f; i <= r; i ++ ) // copy nd[i] = b[i - f]; free(b); } void MgSort(Node * nd, int f, int r) { if (f < r) { int m = (f + r) / 2 ; MgSort(nd, f, m); MgSort(nd, m + 1 , r); Merge(nd, f, m, r); } } int main() { int i, j; int n; double x0, y0, x1, y1; double k, t; double l, r; while (scanf( " %d " , & n) != EOF) { for (i = 0 ; i < n; i ++ ) { scanf( " %d%d%d%d " , & lin[i].x0, & lin[i].y0, & lin[i].x1, & lin[i].y1); } scanf( " %lf%lf " , & l, & r); for (i = 0 ; i < n; i ++ ) { k = 1.0 * (lin[i].y1 - lin[i].y0) / (lin[i].x1 - lin[i].x0); nd[i].l = k * (l - lin[i].x0) + lin[i].y0; nd[i].r = k * (r - lin[i].x0) + lin[i].y0; } qsort(nd, n, sizeof (Node), cmp); count = 0 ; MgSort(nd, 0 , n - 1 ); printf( " %lld\n " , count); } // system("pause"); } ]]> zoj3129--閫嗗簭瀵?/title> http://m.shnenglu.com/hoolee/archive/2012/08/13/187069.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 13 Aug 2012 07:04:00 GMT http://m.shnenglu.com/hoolee/archive/2012/08/13/187069.html http://m.shnenglu.com/hoolee/comments/187069.html http://m.shnenglu.com/hoolee/archive/2012/08/13/187069.html#Feedback 1 http://m.shnenglu.com/hoolee/comments/commentRss/187069.html http://m.shnenglu.com/hoolee/services/trackbacks/187069.html 棰樻剰鎻忚堪錛?br />姹傝嫢騫叉潯綰挎浜ゅ弶鐐圭殑涓暟銆傞鐩繚璇佷笉浼氭湁涓ゆ潯浠ヤ笂鐨勭嚎孌典氦涓庝竴鐐廣?br />涔嶄竴鐪嬭繕浠ヤ負鏄綆楀嚑浣曠殑涓滆タ錛屽叾瀹炰笉鐒訛紝棰樼洰鐨勬潯浠墮檺鍒朵嬌寰楄繖涓棰樺緢綆鍗曘傛垜浠妸棰樼洰鎻忚堪鐨勫湴鍥炬兂璞′負絎涘崱灝斿潗鏍囩郴涓婄殑鐐癸紝鍙互瑙勫畾錛屼袱杈瑰哺涓婄殑鐐歸兘鏈夌浉鍚岀殑x鍊鹼紙鍒嗗埆涓簒0錛寈1涓攛0<x1錛夛紝榪欐牱錛屽鏋渪0錛寈1鎵澶硅寖鍥村唴瀛樺湪鐩鎬氦鐨勪袱鏉$嚎孌祃1銆乴2鐨勮瘽錛屽亣璁句粬浠笌x0錛寈1浜ょ偣鐨剏鍊煎垎鍒負l1y0,l1y1鍜宭2y0,l2y1錛岄偅涔堣繖涓ゆ潯綰挎蹇呴』婊¤凍浠ヤ笅綆鍗曟潯浠訛細(l1y0-l2y0)*(l1y1-l2y1)<0銆備篃灝辨槸璇達紝鍦ㄧ洿綰縳0涓婂拰x1涓婏紝l1銆乴2鐨剏鍊煎ぇ灝忛『搴忔槸鐩稿弽鐨勶紝榪欒鎴戜滑鑱旀兂鍒頒簡閫嗗簭瀵廣?br />鍏蜂綋鍋氭硶鏄細 鍏堝皢姣忔潯綰挎鎸墄0瀵瑰簲鐨剏鍊兼帓搴忥紙鎴戠О涔嬩負絎竴嬈℃帓搴忥級錛岀劧鍚庢牴鎹畑1瀵瑰簲鐨剏鍊兼眰鍑洪嗗簭瀵圭殑涓暟錛屾棦鏄氦鍙夌偣鐨勪釜鏁般傛眰閫嗗簭瀵圭殑鏂規硶鏈鐩存帴鐨勫氨鏄湪鍐掓場鎺掑簭鏄褰曚氦鎹㈢殑嬈℃暟錛屼笉榪囪繖鏍蜂細瓚呮椂錛屾敼榪涚殑綆楁硶鏄埄鐢ㄥ綊騫舵帓搴忥紝鍦ㄦ瘡嬈″綊騫剁殑鏃跺欑粺璁¢嗗簭瀵逛釜鏁幫紙娉ㄦ剰涓や釜鏁扮浉絳夌殑鎯呭喌錛屽綋涓ゆ暟鐩哥瓑鏃跺畠浠笉鏄嗗簭瀵?/strong>錛夈?br />娉ㄦ剰錛氬湪絎竴嬈℃帓搴忎腑錛?strong>鍥犱負涓嶅悓綰挎鐨剏鍊煎彲鑳芥槸鐩哥瓑鐨勶紝榪欑鎯呭喌涓嬫垜浠渚濇嵁x1瀵瑰簲鐨剏鍊兼帓搴忋傚拷鐣ヨ繖縐嶆儏鍐典細瀵艱嚧璁$畻鐨勯嗗簭瀵逛釜鏁板澶氥?/strong> 閫嗗簭瀵瑰弬闃咃細http://m.shnenglu.com/hoolee/archive/2012/07/18/184090.html 鍋氱殑濂借壈杈涳紝鎰熻阿鍐板啺瀛﹂暱銆?br />浠ヤ笅鏄湰棰樹唬鐮侊細#include < stdio.h > #include< stdlib.h > #define LEN 1010000 typedef struct { int e; int w; }Road; long long count; Road rd[LEN]; int cmp( const void * a, const void * b) { Road * a0 = (Road * )a; Road * b0 = (Road * )b; if (a0 -> e != b0 -> e) return a0 -> e > b0 -> e ? 1 : - 1 ; else return a0 -> w > b0 -> w ? 1 : - 1 ; } void Merge(Road * rd, int f, int m, int r) { int i, j; Road * b = (Road * )malloc( sizeof (Road) * (r - f + 3 )); i = f; j = m + 1 ; int k = 0 ; while (i <= m && j <= r) { if (rd[i].w > rd[j].w) b[k ++ ] = rd[j ++ ]; else { b[k++ ] = rd[i ++ ]; if (k + f > i) count += (k + f - i); } } while (i <= m) { b[k ++ ] = rd[i ++ ]; if (k + f > i) count += (k + f - i); } while (j <= r) b[k ++ ] = rd[j ++ ]; for (i = f; i <= r; i ++ ) rd[i] = b[i - f]; free(b); } void MgSort(Road * rd, int f, int r) { if (f < r) { int m = (f + r) / 2 ; MgSort(rd, f, m); MgSort(rd, m + 1 , r); Merge(rd, f, m, r); } } int main() { int i, j, k; int N, M, K; int T; scanf( " %d " , & T); for (k = 1 ; k <= T; k ++ ) { scanf( " %d%d%d " , & N, & M, & K); for (i = 0 ; i < K; i ++ ) scanf( " %d%d " , & rd[i].e, & rd[i].w); qsort(rd, K, sizeof (Road), cmp); count = 0 ; MgSort(rd, 0 , K - 1 ); printf( " Test case %d: %lld\n " , k, count); } // system("pause"); return 0 ; } ]]> CodeForces204B--浜屽垎鏌ユ壘 http://m.shnenglu.com/hoolee/archive/2012/08/06/186460.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 06 Aug 2012 07:16:00 GMT http://m.shnenglu.com/hoolee/archive/2012/08/06/186460.html http://m.shnenglu.com/hoolee/comments/186460.html http://m.shnenglu.com/hoolee/archive/2012/08/06/186460.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/186460.html http://m.shnenglu.com/hoolee/services/trackbacks/186460.html 榪欐槸瀹為獙瀹ら泦璁紑濮嬬涓嬈℃瘮璧涚殑D棰樸?br />棰樻剰鎻忚堪錛氱粰浣爊寮犲崱鐗囷紝姣忓紶鍗$墖姝e弽闈㈤兘鏈夐鑹詫紙涓ら潰鐨勯鑹插彲鑳界浉鍚岋紝鎴栦笉鍚岋級錛屽皢榪欎簺鍗$墖鏀懼湪妗岄潰涓婏紝姣忔鎿嶄綔浣犲彲浠ュ皢涓寮犲崱鐗囩炕闈€傞棶鐨勬槸鑳藉惁閫氳繃鏈灝戠殑緲婚潰嬈℃暟浣垮緱姝i潰鏈変竴縐嶉鑹茬殑鏁伴噺>=鍗$墖鏁扮殑涓鍗婏紝騫惰緭鍑虹炕闈㈡鏁般?br />瑙i鐨勫ぇ鑷存濊礬鏄紝鐢ˋ[]緇熻鍑烘墍鏈夊彲鑳藉嚭鐜扮殑棰滆壊浠ュ強璇ョ棰滆壊鍑虹幇鐨勬繪鏁幫紝鐢˙[]緇熻姝i潰鐨勯鑹蹭互鍙婅縐嶉鑹插嚭鐜扮殑嬈℃暟銆傚鏋淎[]涓湁鏌愮棰滆壊鍑虹幇鐨勬鏁?gt;=(n+1)/2錛岃鏄庨氳繃鑻ュ共嬈$炕闈㈡搷浣滄垜浠槸鍙互杈懼埌鐩殑鐨勶紝榪欐椂鍙渶鍐嶅弬鐓[]錛屽嵆鍙畻鍑虹炕闈㈡鏁般?br />鎬濊礬寰堟竻鏅幫紝鍙槸鏈変竴浜涗笉寰椾笉娉ㄦ剰鐨勭粏鑺傘?br />1.褰撳崱鐗囦袱闈㈢殑棰滆壊鐩稿悓鏃訛紝鍙兘緇熻涓嬈°?br />2.鏁版嵁閲忓緢澶э紝鏌ユ壘鏃惰鐢ㄤ簩鍒嗐?br />3.濡傛灉涓縐嶉鑹插湪鍙湪鍙嶉潰鍑虹幇錛孊[]涓槸鎵句笉鍒板畠鐨勩?/strong> 浠ヤ笅鏄湰棰樹唬鐮侊細#include < stdio.h > #include< stdlib.h > #define LEN 2000200 #define LENC 200010 #define MAX 10000000 typedef struct { int c; // color int n; // time }Node; typedef struct { int c; int f; // front or down, 1 or 0 }Color; Color C[LENC]; int lenc; Node A[LEN]; int lena; Node B[LEN]; int lenb; int cmpc( const void * a, const void * b) { Color * a0 = (Color * )a; Color * b0 = (Color * )b; return a0 -> c - b0 -> c; } int Min( int a, int b) { if (a < b) return a; return b; } int main() { int i, j; int n; while (scanf( " %d " , & n) != EOF) { int c1, c2; lenc = 0 ; for (i = 0 ; i < n; i ++ ) { scanf( " %d%d " , & c1, & c2); C[lenc].c = c1; C[lenc ++ ].f = 1 ; if (c2 != c1) { C[lenc].c = c2; C[lenc ++ ].f = 0 ; } } qsort(C, lenc, sizeof (Color), cmpc); lenb = 0 ; // init B[] for (i = 0 ; i < lenc; i ++ ) if (C[i].f == 1 ) { B[ 0 ].c = C[i].c; B[ 0 ].n = 1 ; lenb = 1 ; i ++ ; break ; } for (; i < lenc; i ++ ) { if (C[i].f == 1 ) { if (C[i].c == B[lenb - 1 ].c) { B[lenb - 1 ].n ++ ; } else { B[lenb].c = C[i].c; B[lenb ++ ].n = 1 ; } } } lena = 0 ; // init A[] A[ 0 ].c = C[ 0 ].c; A[ 0 ].n = 1 ; lena = 1 ; for (i = 1 ; i < lenc; i ++ ) { if (C[i].c == A[lena - 1 ].c) { A[lena - 1 ].n ++ ; } else { A[lena].c = C[i].c; A[lena ++ ].n = 1 ; } } int psb = 0 ; int mint = MAX; for (i = 0 ; i < lena; i ++ ) { int t = (n + 1 ) / 2 ; if (A[i].n >= t) { int ii = 0 ; int jj = lenb - 1 ; int find = 0 ; int mid; while (ii <= jj) // binSearch { mid = (ii + jj) / 2 ; if (B[mid].c == A[i].c) { find = 1 ; break ; } else if (A[i].c < B[mid].c) { jj = mid - 1 ; } else ii = mid + 1 ; } if (find == 1 ) { int k = t - B[mid].n; mint = Min(mint, k); } else mint = Min(mint, t); psb = 1 ; } } if (psb == 1 ) { if (mint >= 0 ) printf( " %d\n " , mint); else printf( " 0\n " ); } else printf(" -1\n " ); } // system("pause"); } ]]> poj1862--浼樺厛闃熷垪銆佽椽蹇?/title> http://m.shnenglu.com/hoolee/archive/2012/07/21/184517.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Sat, 21 Jul 2012 14:22:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/21/184517.html http://m.shnenglu.com/hoolee/comments/184517.html http://m.shnenglu.com/hoolee/archive/2012/07/21/184517.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/184517.html http://m.shnenglu.com/hoolee/services/trackbacks/184517.html 璐績綆楁硶錛屾瘡嬈¢夊彇閲嶉噺鏈澶х殑涓や釜鐢熺墿鍚堝茍鎴愪竴涓嵆鍙備笅闈㈢殑浠g爜鏄湁浼樺厛闃熷垪錛堝ぇ欏跺爢錛夊疄鐜扮殑銆?br />涓嶈繃錛屾繁鍏ュ垎鏋愪竴涓嬶紝鐢辨暟瀛﹀叕寮忓彲浠ヨ瘉鏄庯細m1+m2 >= 2*sqrt(m1*m2)錛屽洜姝ゅ綋涓や釜鐢熺墿鍚堝茍鍚庯紝閲嶉噺涓瀹氭槸鍓╀綑鐢熺墿涓渶澶х殑錛岀敱姝ゅ彧瑕佸皢鍘熼噸閲忔寜闄嶅簭鎺掑簭涓嬈★紝鐒跺悗渚濇鍚堝茍鍗沖彲銆?br />浼樺厛闃熷垪鏈変簺澶ф潗灝忕敤浜嗐?
#include < stdio.h > #include< stdlib.h > #include< math.h > #define LEN 110 void f( double * a, int top, int r) { // 絳涢夊嚱鏁幫紝淇濇寔澶ч《鍫嗙殑鎬ц川銆?/span> int i, j; for (j = 2 * top; j <= r; j *= 2 ) { if (j < r && a[j] < a[j + 1 ]) j ++ ; if (a[j] <= a[j / 2 ]) break ; double t = a[j]; a[j] = a[j / 2 ]; a[j / 2 ] = t; } } double DeQueue( double * a, int * r) { double t = a[ 1 ]; a[ 1 ] = a[ * r]; --* r; f(a, 1 , * r); return t; } void EnQueue( double * a, int * r, double num) { ++* r; a[ * r] = num; int i = * r; while ( 1 ) { if (i > 1 && a[i] > a[i / 2 ]) { double t = a[i]; a[i] = a[i / 2 ]; a[i / 2 ] = t; i /= 2 ; } else break ; } }int main() { int i, j; int N; int r; double a[LEN]; double w; while (scanf( " %d " , & N) != EOF) { for (i = 1 ; i <= N; i ++ ) scanf( " %lf " , & a[i]); for (i = N / 2 ; i >= 1 ; i -- ) // 寤虹珛澶ч《鍫嗭紝鍗蟲槸鍒濆鍖栭槦鍒?/span> f(a, i, N); r = N; while (r > 1 ) { double m1 = DeQueue(a, & r); double m2 = DeQueue(a, & r); w = 2.0 * sqrt(m1 * m2); EnQueue(a, & r, w); } printf(" %.3lf\n " , a[ 1 ]); } } ]]> poj2299--閫嗗簭瀵?/title> http://m.shnenglu.com/hoolee/archive/2012/07/18/184090.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Wed, 18 Jul 2012 09:46:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/18/184090.html http://m.shnenglu.com/hoolee/comments/184090.html http://m.shnenglu.com/hoolee/archive/2012/07/18/184090.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/184090.html http://m.shnenglu.com/hoolee/services/trackbacks/184090.html 榪欐牱鍋氱湅浼煎彲琛岋紝鍏跺疄鏄涓嶉氱殑錛屾暟鎹噺鏄?00000錛岀敱浜庡啋娉℃帓搴忕殑鏃墮棿澶嶆潅搴︽槸O(N^2)錛屾墍浠ラ棶棰樼殑瑙勬ā灝辨槸500000^2=2.5 * E11錛屼竴鑸垜浠涓鴻綆楁満姣忕鐨勮綆楅噺鏄疎9錛屽洜姝ょ敤鍐掓場鎺掑簭鏄涓嶉氱殑銆?br />鑱旀兂鏈夊叧鎺掑簭鐨勭畻娉曪紝鎴戜滑甯屾湜榪欎竴棰樼殑鏃墮棿澶嶆潅搴﹁兘澶熼檷涓篛(NlogN)錛屽揩鎺掋佸爢鎺掑簭銆佸悎騫舵帓搴忔弧瓚寵繖鏍風殑瑕佹眰錛屽彲鏄墠涓ょ鎺掑簭鏂瑰紡鐨勪氦鎹㈡柟寮忔鏃犺寰嬪彲寰紝鍙墿涓嬪綊騫舵帓搴忋?br />鎴戜滑鏉ョ湅褰掑茍鎺掑簭錛屽畠鐨勬牳蹇冩槸褰掑茍錛堢敱Merge()鍑芥暟瀹炵幇錛夛紝灝辨槸灝嗕袱涓湁搴忓簭鍒楀悎騫朵負涓涓湁搴忓簭鍒椼傜敱鍐掓場鎺掑簭鎴戜滑鐭ラ亾錛屼氦鎹㈢殑鎬繪鏁板氨鏄垵濮嬪簭鍒椾腑姣忎釜鍏冪礌浜ゆ崲嬈℃暟鐨勬誨拰錛屾瘡涓厓绱犵殑浜ゆ崲嬈℃暟絳変簬璇ュ厓绱犲悗闈㈡瘮鑷繁灝忕殑鍏冪礌鐨勪釜鏁幫紙鍥犱負鏈緇堟瘮鑷繁灝忕殑鍏冪礌閮藉湪鑷繁鍓嶉潰錛夈?br />涓嬪浘鏄竴嬈erge()榪囩▼錛?br /> 鍙互鐪嬪嚭錛屽厓绱?#8220;1”娌℃湁縐誨姩錛屽厓绱?#8220;4”鍚戝悗縐誨姩浜?浣嶏紝鍏冪礌“10”鍚戝悗縐誨姩浜?浣嶏紝鎵浠ユ湰嬈″悎騫跺叡縐誨姩浜?嬈°傜粺璁″悎騫舵帓搴忚繃紼嬩腑鎵鏈夌殑縐誨姩嬈℃暟鍗沖彲銆?br />鏈浠g爜濡備笅
#include < stdio.h > #include< stdlib.h > #define LEN 500010 long long count; void Copy( int * a, int * b, int f, int r) { for ( int i = 0 ; i <= r - f; i ++ ) a[i + f] = b[i]; } void Merge( int * a, int f, int m, int r) { int * b = ( int * )malloc( sizeof ( int ) * ( r - f + 1 )); int i = f; int j = m + 1 ; int k = 0 ; while (i <= m && j <= r) { if (a[i] > a[j]) b[k ++ ] = a[j ++ ]; else { b[k ++ ] = a[i ++ ]; if (k + f > i) count += k + f - i; } } while (i <= m) { b[k ++ ] = a[i ++ ]; if (k + f > i) count += k + f - i; } while (j <= r) b[k ++ ] = a[j ++ ]; Copy(a, b, f, r); free(b); } void MergeSort( int * a, int f, int r) { if (f < r) { int i = (r + f) / 2 ; MergeSort(a, f, i); // ÅÅÐò×ó°ë²¿·Ö MergeSort(a, i + 1 , r); // ÅÅÐòÓҰ벿·Ö Merge(a, f, i, r); // ºÏ²¢ } }int main() { int i, j; int N; int a[LEN]; scanf( " %d " , & N); while (N != 0 ) { for (i = 1 ; i <= N; i ++ ) scanf( " %d " , & a[i]); count = 0 ; MergeSort(a, 1 , N); printf( " %lld\n " , count); scanf( " %d " , & N); } // system("pause"); } 鏈夊叧鍚堝茍鎺掑簭璇峰弬闃咃細http://m.shnenglu.com/hoolee/archive/2012/07/18/184029.html ]]> 鍚堝茍鎺掑簭銆佺洿鎺ユ彃鍏ユ帓搴?/title> http://m.shnenglu.com/hoolee/archive/2012/07/18/184029.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Wed, 18 Jul 2012 03:12:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/18/184029.html http://m.shnenglu.com/hoolee/comments/184029.html http://m.shnenglu.com/hoolee/archive/2012/07/18/184029.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/184029.html http://m.shnenglu.com/hoolee/services/trackbacks/184029.html 鍚堝茍鎺掑簭鏄埄鐢ㄤ簡鍒嗘不鎬濇兂鐨勬帓搴忔柟寮忥紝鍏鋒湁O(NlogN)鐨勬椂闂村鏉傚害錛屼笌蹇熸帓搴忋佸爢鎺掑簭鐩告瘮錛屽畠闇瑕丯鐨勮緟鍔╃┖闂淬傚畠鐨勬牳蹇冮儴鍒嗘槸灝嗕袱涓湁搴忓簭鍒楀悎騫訛紙鐢盡erge()鍑芥暟瀹炵幇錛夈?br />鍚堝茍鎺掑簭鐨勫熀鏈濇兂鏄細鍗曚釜鍏冪礌鏄湁搴忕殑錛屼袱涓緝灝忕殑鏈夊簭搴忓垪鍙鍚堝茍涓轟竴涓緝澶х殑鏈夊簭搴忓垪銆?br />綆楁硶鎻忚堪濡備笅錛?
void MergeSort( int * a, int f, int r) { if (f < r) { int i = (r + f) / 2 ; MergeSort(a, f, i); // 鎺掑簭宸﹀崐閮ㄥ垎 MergeSort(a, i + 1 , r); // 鎺掑簭鍙沖崐閮ㄥ垎 Merge(a, f, i, r); // 鍚堝茍 } }void Merge( int * a, int f, int m, int r) { int * b = ( int * )malloc( sizeof ( int ) * ( r - f + 1 )); int i = f; int j = m + 1 ; int k = 0 ; while (i <= m && j <= r) { if (a[i] > a[j]) b[k ++ ] = a[j ++ ]; else b[k++ ] = a[i ++ ]; } while (i <= m) b[k ++ ] = a[i ++ ]; while (j <= r) b[k ++ ] = a[j ++ ]; Copy(a, b, f, r); free(b); } void Copy( int * a, int * b, int f, int r) { for ( int i = 0 ; i <= r - f; i ++ ) a[i + f] = b[i]; } 鐩存帴鎻掑叆鎺掑簭 錛屾椂闂村鏉傚害O(N^2)錛屽熀鏈搷浣滄槸灝嗕竴涓厓绱犳彃鍏ュ埌鏈夊簭搴忓垪涓傚綋寰呮帓搴忓厓绱犱釜鏁頒負n鏃訛紝鍥犱負絎竴涓厓绱犳槸鏈夊簭鐨勶紝鍥犳鍙渶緇忚繃n - 1嬈℃彃鍏ワ紝灝辮兘瀹屾垚鎺掑簭銆?br />鍗曟鎻掑叆鐨勮繃紼嬩負錛?br />1.鎵懼埌瑕佹彃鍏ュ厓绱犲湪宸叉帓搴忛儴鍒嗕腑鐨勪綅緗甹銆?br />2.灝嗘湁搴忓簭鍒椾腑j鍚庨潰鐨勬墍鏈夊厓绱犲悜鍚庣Щ鍔ㄤ竴浣嶏紝涓哄緟鎻掑叆鍏冪礌絀哄嚭浣嶇疆銆?br />3.灝嗗緟鎺掑簭鍏冪礌鎻掑叆j浣嶇疆錛屼繚鎸佸簭鍒楁湁搴忋?br />綆楁硶鎻忚堪涓猴細
void InsertSort( int * a, int n) { // 鏁扮粍涓嬫爣浠?寮濮嬶紝0鍙峰厓绱犳槸鏈夊簭鐨?/span> int i, j, k; for (i = 1 ; i < n; i ++ ) { j = - 1 ; int t = a[i]; while (a[ ++ j] < t); // 鎵懼埌瑕佹彃鍏ョ殑浣嶇疆 for (k = i; k > j; k -- ) // 鍚戝悗縐誨姩鍏冪礌 a[k] = a[k - 1 ]; a[j] = t; // 鎻掑叆 } } ]]> 蹇熸帓搴忋佺嚎鎬ф椂闂撮夋嫨 http://m.shnenglu.com/hoolee/archive/2012/07/17/183909.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Tue, 17 Jul 2012 08:46:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/17/183909.html http://m.shnenglu.com/hoolee/comments/183909.html http://m.shnenglu.com/hoolee/archive/2012/07/17/183909.html#Feedback 1 http://m.shnenglu.com/hoolee/comments/commentRss/183909.html http://m.shnenglu.com/hoolee/services/trackbacks/183909.html 闃呰鍏ㄦ枃 ]]> poj2388瀵繪壘涓綅鏁?-鍐掓場鎺掑簭錛屽爢鎺掑簭錛岀嚎鎬ф椂闂撮夋嫨 http://m.shnenglu.com/hoolee/archive/2012/07/16/183748.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 16 Jul 2012 07:52:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/16/183748.html http://m.shnenglu.com/hoolee/comments/183748.html http://m.shnenglu.com/hoolee/archive/2012/07/16/183748.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/183748.html http://m.shnenglu.com/hoolee/services/trackbacks/183748.html 1#include<... 闃呰鍏ㄦ枃 ]]> 鍐掓場鎺掑簭 http://m.shnenglu.com/hoolee/archive/2012/07/16/183743.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 16 Jul 2012 07:22:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/16/183743.html http://m.shnenglu.com/hoolee/comments/183743.html http://m.shnenglu.com/hoolee/archive/2012/07/16/183743.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/183743.html http://m.shnenglu.com/hoolee/services/trackbacks/183743.html 鍐掓場鎺掑簭鏄渶鍩烘湰鐨勬帓搴忔柟寮忥紝寰堢畝鍗曪紝瀹規槗鐞嗚В錛屼絾綆楁硶鐨勬椂闂村鏉傚害涓篛(N^2)錛岄傚悎浜庡熀鏁頒笉澶х殑鎺掑簭銆?br />涓嬮潰鐨勪唬鐮佷腑bsort鍑芥暟瀹屾垚鍐掓場鎺掑簭錛屾暟緇勪笅鏍囦粠1寮濮嬨?/p>
1 #include < stdio.h > 2 #include< stdlib.h > 3 #define LEN 4 void swap( int * a, int * b) 5 { 6 int t = * a; 7 * a = * b; 8 * b = t; 9 }10 void bsort( int * a, int n) 11 { 12 int i, j; 13 for (j = n; j > 1 ; j -- ) 14 for (i = 1 ; i < j; i ++ ) 15 { 16 if (a[i] > a[i + 1 ]) 17 swap(& a[i], & a[i + 1 ]); 18 }19 }20 int main() 21 { 22 int i, j; 23 int a[LEN] = { 0 , 1 , 5 , 95 , 7 , 3 , 8 , 0 , 90 , 25 , 13 } ; 24 int n = 10 ; 25 bsort(a, n); 26 27 for (i = 1 ; i <= n; i ++ ) 28 printf(" %3d " , a[i]); 29 putchar(10 ); 30 system(" pause " ); 31 }32
]]> 鍫嗘帓搴?/title> http://m.shnenglu.com/hoolee/archive/2012/07/16/183700.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 16 Jul 2012 03:18:00 GMT http://m.shnenglu.com/hoolee/archive/2012/07/16/183700.html http://m.shnenglu.com/hoolee/comments/183700.html http://m.shnenglu.com/hoolee/archive/2012/07/16/183700.html#Feedback 0 http://m.shnenglu.com/hoolee/comments/commentRss/183700.html http://m.shnenglu.com/hoolee/services/trackbacks/183700.html 鍫嗙殑瀛樺偍鏂瑰紡鏄竴緇存暟緇勶紝鍥犱負瀹冩槸涓媯靛畬鍏ㄤ簩鍙夋爲錛屽瀛愪笌鍙屼翰涓嬫爣鏈夌畝鍗曠洿鎺ョ殑璁$畻鏂瑰紡鈥︹?nbsp; 闃呰鍏ㄦ枃 ]]> 青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
国产目拍亚洲精品99久久精品 |
国内精品福利 |
亚洲国产乱码最新视频 |
欧美激情亚洲另类 |
久久琪琪电影院 |
欧美精品一区二区精品网 |
欧美高清在线 |
亚洲综合另类 |
国产精品久久国产三级国电话系列 |
亚洲视频第一页 |
亚洲国产精品传媒在线观看
|
国产精品国产亚洲精品看不卡15 |
国内精品久久久久久久影视麻豆 |
久久中文在线 |
欧美三级特黄 |
一二三四社区欧美黄 |
亚洲国产专区 |
亚洲国产综合91精品麻豆 |
久久人人爽爽爽人久久久 |
久久久久国产精品厨房 |
久久久噜噜噜久久 |
亚洲欧美一区在线 |
国产欧美精品一区二区三区介绍 |
亚洲一级网站 |
亚洲婷婷在线 |
国产精品自在线 |
久久国产精品久久久久久久久久 |
午夜在线一区 |
影音先锋欧美精品 |
91久久精品国产91性色tv |
欧美黄在线观看 |
亚洲视频免费在线 |
亚洲午夜激情网页 |
国产亚洲网站 |
欧美福利影院 |
欧美色欧美亚洲另类二区 |
午夜视频久久久久久 |
欧美在线1区 |
亚洲国产另类久久久精品极度 |
亚洲国产成人一区 |
欧美日韩一区二区三区免费看 |
亚洲一区中文 |
欧美一区二区三区在线免费观看
|
在线免费观看欧美 |
欧美激情中文不卡 |
国产精品二区三区四区 |
欧美在线视频二区 |
免费一级欧美片在线播放 |
美女主播一区 |
91久久精品国产91久久性色tv |
欧美日韩国产区一 |
久久久999精品免费 |
欧美激情一区二区三区蜜桃视频 |
午夜在线成人av |
美女精品视频一区 |
性欧美暴力猛交69hd |
久久精品99国产精品日本 |
亚洲经典在线 |
亚洲欧美一区在线 |
日韩视频在线观看国产 |
欧美在线日韩 |
亚洲一级二级 |
欧美在线资源 |
亚洲欧美日韩另类 |
欧美精品v日韩精品v韩国精品v |
亚洲一区视频在线 |
欧美xxx成人 |
久久精品视频免费观看 |
欧美日韩免费观看一区二区三区
|
亚洲黄色小视频 |
亚洲专区一区 |
中文高清一区 |
欧美黄色aa电影 |
一区二区欧美国产 |
亚洲第一中文字幕在线观看 |
亚洲伦理在线 |
一区二区电影免费观看 |
亚洲风情在线资源站 |
亚洲国产mv |
久久精品国产96久久久香蕉 |
亚洲国产精品毛片 |
中文av一区特黄 |
免费美女久久99 |
久久嫩草精品久久久精品一 |
欧美三日本三级少妇三99 |
欧美成年人网 |
精品电影在线观看 |
午夜伦理片一区 |
亚洲在线日韩 |
欧美日韩不卡 |
99精品国产福利在线观看免费 |
亚洲精品欧洲 |
欧美大片va欧美在线播放 |
欧美成人精品在线观看 |
激情视频亚洲 |
久久精品视频在线观看 |
一区二区三区成人 |
欧美激情免费在线 |
亚洲经典视频在线观看 |
亚洲第一黄色网 |
久久三级视频 |
男人的天堂成人在线 |
韩日午夜在线资源一区二区 |
欧美在线一二三四区 |
久久久久99 |
在线观看三级视频欧美 |
久久在线视频在线 |
亚洲成色最大综合在线 |
狠狠色狠狠色综合日日五 |
午夜久久一区 |
欧美顶级艳妇交换群宴 |
999亚洲国产精 |
欧美色综合天天久久综合精品 |
午夜精品视频 |
国产欧美精品国产国产专区 |
欧美在线一二三 |
欧美国产日韩免费 |
一本色道久久88综合亚洲精品ⅰ
|
久久精品免视看 |
欧美激情亚洲精品 |
一本久道久久综合狠狠爱 |
欧美三级电影精品 |
午夜影院日韩 |
嫩草伊人久久精品少妇av杨幂 |
亚洲精品国产精品久久清纯直播
|
国产手机视频精品 |
久久精品99国产精品日本 |
欧美高清在线一区二区 |
一区二区三区久久久 |
国产片一区二区 |
美女日韩在线中文字幕 |
99国产精品视频免费观看 |
在线免费观看视频一区 |
亚洲欧美日本在线 |
亚洲精品一区二区网址 |
国产欧美一区在线 |
亚洲国产小视频 |
欧美性色aⅴ视频一区日韩精品 |
亚洲免费在线观看视频 |
亚洲成人在线网 |
国产精品免费一区豆花 |
欧美+亚洲+精品+三区 |
亚洲激情第一页 |
欧美激情久久久 |
国产欧美一区二区白浆黑人 |
国产精品美女视频网站 |
亚洲欧美成人一区二区在线电影 |
亚洲美女精品一区 |
亚洲图片在区色 |
欧美精品成人 |
亚洲日本电影 |
久久国产精品久久久 |
亚洲欧美成人综合 |
亚洲在线观看免费 |
欧美成人午夜激情视频 |
一区二区日韩伦理片 |
亚洲无限av看 |
国产日产欧产精品推荐色
|
日韩天堂av |
欧美精品一区二区三区在线播放 |
亚洲午夜免费福利视频 |
欧美成人免费播放 |
欧美永久精品 |
亚洲女女女同性video |
日韩视频一区 |
最近看过的日韩成人 |
在线观看精品视频 |
久久精品一区二区三区不卡 |
亚洲夜晚福利在线观看 |
亚洲欧洲午夜 |
欧美高清视频一区二区 |
免费日韩一区二区 |
久久―日本道色综合久久 |
午夜精品一区二区三区在线播放 |
国产欧美日韩亚州综合 |
欧美激情综合色 |
麻豆成人综合网 |
欧美精品在线观看 |
中文高清一区 |
日韩亚洲不卡在线 |
亚洲精品国精品久久99热 |
亚洲电影av |
女仆av观看一区 |
久久人体大胆视频 |
久久免费高清 |
欧美网站在线 |
一区二区三区四区五区精品 |
影音先锋亚洲视频 |
欧美专区在线观看 |
香蕉视频成人在线观看 |
欧美午夜视频网站 |
在线综合视频 |
久久国产精品久久国产精品 |
国产日韩精品电影 |
亚洲婷婷综合久久一本伊一区 |
久久久久一区二区 |
在线看视频不卡 |
亚洲国产精品尤物yw在线观看
|
欧美福利一区二区 |
欧美区一区二 |