]]>SPOJ 2154 Kruskalhttp://m.shnenglu.com/sdfond/archive/2010/02/06/107365.htmlsdfondsdfondSat, 06 Feb 2010 01:04:00 GMThttp://m.shnenglu.com/sdfond/archive/2010/02/06/107365.htmlhttp://m.shnenglu.com/sdfond/comments/107365.htmlhttp://m.shnenglu.com/sdfond/archive/2010/02/06/107365.html#Feedback0http://m.shnenglu.com/sdfond/comments/commentRss/107365.htmlhttp://m.shnenglu.com/sdfond/services/trackbacks/107365.html銆銆鐚村瓙鍜孠ruskal鐜╀竴涓彇鐭沖瓙娓告垙錛岀粰瀹歯鍫嗙煶瀛愶紝n涓嶅ぇ浜?00錛屾瘡鍫嗙煶瀛愮殑涓暟澶т簬2灝忎簬2 ^
32錛屽弻鏂硅疆嫻佸彇瀛愶紝姣忔鍙互浠庝竴鍫嗕腑鍙栨渶澶歬涓紝褰撲竴鏂瑰彇瀹岀煶瀛愬悗鏌愬爢鐭沖瓙鐨勪釜鏁版槸绱犳暟鐨勮瘽閭d箞褰撳墠鐜╁鑾瘋儨銆傞棶鐚村瓙鏄惁鏈夊繀鑳滅瓥鐣ャ?br> 銆愰鐩垎鏋愩?br>銆銆榪欐槸涓閬揃T棰橈紝涓棿璁劇疆浜嗚澶歵rick銆傚紑濮嬪棰樻剰娌℃湁瀹屽叏鐞嗚В錛岄敊浜嗗緢澶氭錛屽悗鏉ユ壘鏉ヤ簡鏁版嵁錛屾墠鍙戠幇浜嗛棶棰樸?br>銆銆棰樼洰涓弿榪扮殑鑾瘋儨絳栫暐鏄細"A
player wins if after his move the size of some heap is a prime
number."榪欏彞璇濅箥涓鐪嬩互涓烘槸鍙栧畬鐭沖瓙鍚庡墿涓嬬殑鐭沖瓙涓暟鏄礌鏁扮殑鏃跺欏氨鑾瘋儨錛屽叾瀹炶繕闅愯棌鐫鍙︿竴縐嶅彲鑳斤細濡傛灉澶氬爢鐭沖瓙涓暟鏄礌鏁幫紝褰撳墠鐜╁鏃犺鎬庢牱鍙栭兘鑳借幏鑳滐紝鍥犱負鍦ㄤ粬鍙栧畬涔嬪悗錛屽叾浠栧爢鐨勭煶瀛愪釜鏁版槸绱犳暟錛屼篃婊¤凍鑾瘋儨鏉′歡銆?br>銆銆鎺ヤ笅鏉ヨ冭檻涓鑸儏鍐點傝繖涓鐩槸闄愬埗涓棿鐘舵佺殑Nim娓告垙錛屼篃灝辨槸璇達紝瀵逛簬涓鍫嗕釜鏁頒負n鐨勭煶瀛愯岃█錛屽畠鐨凷G鍊煎彇鍐充簬灝忎簬n鐨勬渶澶х礌鏁般傛敞鎰忚繖閲岄璁懼張鏈変簡涓涓皬trick錛岄鐩鏄庝簡闇瑕佸彇1鍒発涓紝濡傛灉褰撳墠鐭沖瓙涓暟鏈韓鏄礌鏁幫紝褰撶劧鏄病鐢ㄧ殑錛屽洜姝ゆ槸灝忎簬n鐨勬渶澶х礌鏁般傝灝忎簬n鐨勬渶澶х礌鏁版槸p(棰樼洰涓鏄庝簡鐭沖瓙涓暟澶т簬2錛屽洜姝涓瀹氬瓨鍦?錛岄偅涔堝彲浠ュ湪k姝ヤ互鍐呭埌杈緋鐨勪竴瀹氭槸蹇呰儨鎬侊紝鑰屼笖鏄洿鎺ヨ幏鑳滐紝闇瑕佸湪杈撳叆鐨勬椂鍊欑壒鍒?榪欎竴鐐歸渶瑕佹敞鎰忥紝鍦ㄨВ鍐抽檺鍒朵腑闂寸姸鎬佺殑Nim娓告垙鏃朵竴鑸兘闇瑕佺壒鍒?銆傜劧鍚庡氨鏄痯
+ k + 1榪欎釜鐘舵侊紝鍥犱負瀹冨彲杈劇殑鐘舵佸叏鏄繀鑳滄侊紝鍥犳瀹冩槸蹇呰觸鎬侊紝SG鍊間負0銆傜幇鍦ㄨ冭檻澶т簬p + k + 1鐨勭姸鎬侊紝闂鍑烘潵浜嗐備互p + k +
2榪欎釜鐘舵佷負渚嬶紝鍥犱負瀹冨彲浠ュ埌杈緋 + 2 ... p + k + 1榪欎簺鐘舵侊紝鍥犱負p + 2 ... p +
k閮芥槸鐩存帴鑾瘋儨鐘舵侊紝濡備綍鍒ゅ畾浠栦滑鐨凷G鍊煎憿錛熷鏋滃亣璁懼畠浠殑SG鍊兼槸1錛岄偅涔坧 + k +
2榪欎釜鐘舵佺殑SG鍊煎簲璇ユ槸2銆備絾鏄濊冧竴涓婼G鍊肩殑瀹氫箟錛屽畠鏄畾涔夊湪涓涓狣AG涓婄殑錛屾墍鏈夌殑鐘舵佹渶鍚庨兘鏄彲浠ュ湪鏈夐檺姝ュ唴杞Щ鍒扮粓姝㈡?蹇呰觸鎬?銆備絾鏄痯 + 1 ...
p + k榪欎簺鐘舵侀兘杞Щ鍒頒簡p榪欎釜鐘舵佷笂錛屾垜浠偗瀹氫笉鑳借瀹歱鐘舵佹槸緇堟鎬侊紝鍥犳浠呬粎鍑焢 + 1 ... p +
k榪欎簺鐘舵佹槸蹇呰儨鎬佸氨綆鍗曠殑鎶婂畠浠殑SG鍊艱涓?鏄笉鎭板綋鐨勶紱榪欎簺闄愬埗鐘舵佸拰浠ュ墠鐨勯鐩繕涓嶅悓錛岃繖浜涢檺鍒剁姸鎬侀兘涓嶈兘杞Щ鍒扮粓姝㈡佷笂錛屼絾鏄敱浜庨鐩殑瑕佹眰錛屽畠浠張閮芥槸蹇呰儨鎬侊紝鍥犳鎶婂畠浠殑SG鍊艱涓烘棤絀峰ぇ鏇村悎閫備簺銆?br>銆銆浠旂粏鎬濊冧竴涓嬪甫闄愬埗鐘舵佺殑SG娓告垙錛屽彲浠ュ彂鐜幫紝瀹冧滑鍜屼竴鑸殑SG娓告垙鐨勫尯鍒湪浜庯紝鍦ㄥ垎鏋愪竴鑸殑SG娓告垙鐨勬椂鍊欙紝瀵逛簬涓涓姸鎬佸浘鑰岃█錛岃漿縐誨埌緇堟鎬佺殑鏃跺欏茍涓嶆剰鍛崇潃娓告垙緇撴潫錛屽洜涓虹帺瀹跺彲浠ラ氳繃璧板叾浠栫殑鐘舵佸浘鏉ヤ繚璇佹槸鍚﹁揪鍒板繀鑳滄侊紱浣嗘槸甯﹂檺鍒剁姸鎬佺殑SG娓告垙錛岄檺鍒剁殑鐘舵佸弻鏂歸兘鏄笉鏁㈣蛋鐨勶紝鍥犱負涓鏃︿竴鏂硅蛋鍏ラ檺鍒剁姸鎬侊紝鍙︿竴鏂圭珛鍒昏幏鑳滐紝娓告垙灝辯粓姝簡銆傚彲浠ヨ涓猴紝鍙璧板叆闄愬埗鎬佸氨鐩稿綋浜庤杈擄紝瀵逛簬鍙屾柟鐜╁鑰岃█鑲畾閮戒笉浼氳繖鏍峰仛錛屽洜姝よ繖浜涢檺鍒剁姸鎬佸氨鎴愪簡“姝葷姸鎬?#8221;錛屽畬鍏ㄥ彲浠ュ拷瑙嗚繖浜涚姸鎬侊紙涔熷氨鏄涓嶅瓨鍦ㄥ埌榪欎簺鐘舵佺殑杞Щ錛夈傞氳繃涓婅堪鍒嗘瀽錛屾垜浠彲浠ヨ瀹歱
+ k +
2榪欎釜鐘舵佺殑SG鍊煎簲璇ユ槸1鑰屼笉鏄?銆?br>銆銆鐜板湪榪欎釜闂鐨勫仛娉曞氨姣旇緝鏄庢湕浜嗭紝瀵逛簬姣忓爢鐭沖瓙錛屽幓鎺夐檺鍒舵佺殑璁ㄨ鍚庯紝灝卞彉鎴愪簡鍦ㄩ泦鍚坽1...k}涓夋嫨鍏冪礌鐨勪竴涓猄ubtraction
Game錛屽畠鐨凷G鍊兼槸妯?k +
1)寰幆鐨勩?br>銆銆鐒跺悗灝辨槸姹傛渶榪戠礌鏁扮殑闂浜嗭紝榪欎釜娌℃湁濂藉姙娉曪紝鍙兘鏆村姏鏋氫婦銆傚浜庝竴涓暟n錛屽湪sqrt(n)鍒皀涔嬮棿瀛樺湪绱犳暟錛堟劅瑙夊簲璇ユ槸錛屼絾鏄笉浼氳瘉錛夛紝鍥犳鏈澶氭灇涓緎qrt(n)嬈″氨鑳芥壘鍒拌В銆備絾鏄瘡嬈℃灇涓懼垽绱犵殑澶嶆潅搴﹁繕鏄痵qrt(n)錛屾誨鏉傚害榪樻槸姣旇緝楂橈紝鎴戝湪鏈湴璺戞暟鎹窇浜?縐掞紝浜や笂鍘昏秴鏃朵簡錛圫POJ鐨勬椂闄?0縐掞紝榪欏眳鐒朵篃瓚呮椂錛屾暟鎹鍙樻侊級銆傛兂浜嗗緢涔呬篃娌℃湁浠涔堟柊鐨勭畻娉曪紝鏃犲鍙兘鍦ㄥ垽绱犱笂涓嬬偣鍔熷か錛岀洿鎺ユ妸Miller-Rabin鎼炲嚭鏉ヤ簡錛岄熷害鎻愰珮鍒頒簡2縐掞紝浠嶇劧瓚呮椂銆傚悗鏉ュ張鍔犱簡涓浜涘父鏁頒笂鐨勪紭鍖栵紝緇堜簬榪囦簡銆?br> 銆愭葷粨銆?br>銆銆榪欎釜棰樼洰鍋氫簡寰堥暱鏃墮棿錛屼竴鏂歸潰鏄棰樹笉娓咃紝閿欎簡鍑犳錛涘彟涓鏂歸潰鏄浜嶴G鐨勭悊璁虹悊瑙g殑涓嶅閫忓交錛屾兂浜嗗緢涔呯粓浜庢兂鏄庣櫧浜嗭紱鍐嶆湁灝辨槸浼樺寲綆楁硶涔熻姳浜嗗緢闀挎椂闂淬備笉榪囬氳繃榪欎釜棰樼洰瀵逛簬SG鐞嗚鐨勭悊瑙e張榪涗簡涓姝ワ紝鎰熻涓嶉敊錛屽懙鍛點?
]]>緇勫悎娓告垙鎬葷粨鈥斺斿熀鏈崥寮堥棶棰?/title>http://m.shnenglu.com/sdfond/archive/2010/02/06/107364.htmlsdfondsdfondSat, 06 Feb 2010 00:55:00 GMThttp://m.shnenglu.com/sdfond/archive/2010/02/06/107364.htmlhttp://m.shnenglu.com/sdfond/comments/107364.htmlhttp://m.shnenglu.com/sdfond/archive/2010/02/06/107364.html#Feedback0http://m.shnenglu.com/sdfond/comments/commentRss/107364.htmlhttp://m.shnenglu.com/sdfond/services/trackbacks/107364.html銆愭榪般?br>銆銆鏈榪戠殑鍑犳姣旇禌錛屽崥寮堢殑棰樼洰涓鐩翠笉灝戯紝鑰屼笖鍗氬紙闂鏄竴鍧楁瘮杈冨鏉傘佸簽澶х殑鍐呭錛屽洜姝ゅ湪榪欓噷灝忕粨涓涓嬶紝甯屾湜鑳藉甯嚜宸辯悊娓呬竴浜涙濊礬錛屼簤鍙栦篃澶氭潵鍑犱釜緋誨垪錛屽懙鍛點?/p>
绔炶禌涓嚭鐜扮殑緇勫悎娓告垙闂涓鑸兘婊¤凍浠ヤ笅鐗瑰緛錛?br>銆銆銆銆1.
浜屼漢鍗氬紙娓告垙錛屾瘡涓漢閮介噰鐢ㄥ鑷繁鏈鏈夊埄鐨勭瓥鐣ワ紝騫朵笖鏄袱涓漢杞祦鍋氬嚭鍐崇瓥 銆銆銆銆2.
鍦ㄦ父鎴忎腑鐨勪換鎰忔椂鍒伙紝姣忎釜鐜╁鍙夋嫨鐨勭姸鎬佹槸鍥哄畾鐨勶紝娌℃湁闅忔満鎴愬垎 銆銆銆銆3.
娓告垙鍦ㄦ湁闄愭鏁板唴緇撴潫錛屾病鏈夊鉤灞鍑虹幇 銆銆澶ч儴鍒嗙殑棰樼洰閮芥弧瓚充笂榪版潯浠訛紝鍥犳榪欓噷鍙璁哄湪涓婅堪鏉′歡鑼冪暣鍐呯殑鍗氬紙闂銆傝繖綾誨崥寮堥棶棰橈紝閫氬父榪樻湁鑻ュ共鍒嗙被銆備竴縐嶆槸瑙勫畾縐誨姩鏈鍚庝竴姝ョ殑娓告垙鑰呰幏鑳滐紝榪欑瑙勫垯鍙仛Normal Play Rule錛涘彟涓縐嶆槸瑙勫畾縐誨姩鏈鍚庝竴姝ョ殑娓告垙鑰呰緭錛岃繖縐嶈鍒欏彨鍋?span style="color: red;">Misere Play
Rule錛屼篃縐頒負Anti-SG娓告垙銆傛澶栵紝瀵逛簬娓告垙鐨勫弻鏂癸紝濡傛灉浜岃呭崥寮堢殑瑙勫垯鐩稿悓錛岄偅涔堢О涓鴻繖綾繪父鎴忔槸瀵圭瓑(impartial games)鐨勶紱鍚﹀垯縐頒負涓嶅鉤絳夋父鎴?/span>(partizan games
)銆傚綋鍒漌HU鐨勯偅鍦烘瘮璧涘氨鏄敱浜庡浜庤繖涓蹇典笉鏄緢娓呮櫚錛屽鑷寸湅瀹岄鐩箣鍚庡氨鐢⊿G瀹氱悊鏉ュ仛錛屾氮璐逛簡寰堝鏈烘椂銆傚疄闄呬笂錛岃В鍐充笉騫崇瓑鍗氬紙闂鐨勬柟娉曞拰鏅氱殑鍗氬紙闂錛圫G娓告垙錛夋槸鏈夊尯鍒殑錛屼竴鑸細閲囩敤鍔ㄦ佽鍒掓垨鑰卻urreal number銆?br> 銆愬崥寮堝熀紜鐭ヨ瘑銆?br>銆銆鍦⊿G娓告垙涓紝鏈涓轟漢鐔熺煡鐨勬槸蹇呰儨蹇呰觸鎬侊紝涔熷彨NP鎬佺悊璁恒傛敞鎰忕殑鏄紝P鎬佸搴旂殑鏄厛鎵嬪繀璐ユ侊紝N鎬佸搴旂殑鏄厛鎵嬪繀鑳滄併傚繀鑳滃繀璐ユ佺悊璁烘槸錛?br>銆銆1. All terminal positions are
P-positions 銆銆2. From every
N-position, there is at least one move to a P-position 銆銆3. From every P-position, every move is to an
N-position 銆銆鑻辨枃鐨勮〃榪伴潪甯哥畝媧佹竻鏅幫紝鑰屼笖榪欎釜鐞嗚涔熷緢濂界悊瑙o紝濡傛灉鍦ㄥ綋鍓嶇姸鎬佺殑涓嬩竴姝ュ彲浠ヨ蛋鍒板繀璐ユ侊紝閭d箞褰撳墠鐜╁灝卞彲浠ヨ蛋鍒伴偅涓姸鎬侊紝鎶婂繀璐ユ佹帹緇欏彟涓鏂癸紱濡傛灉鎵鏈夊彲杈劇姸鎬侀兘鏄繀鑳滄侊紝閭d箞褰撳墠鐜╁鏃犺濡備綍璧幫紝閮戒細鎶婂繀鑳滄佽緇欏鏂廣傛牴鎹繀鑳滃繀璐ユ佺悊璁猴紝鎴戜滑鍙互閫掑綊鐨勬眰鍑烘瘡涓姸鎬佹槸N鎬佽繕鏄疨鎬併傚繀鑳滃繀璐ユ佺悊璁哄叾瀹炲凡緇忔妸鍗氬紙闂杞寲鎴愪簡涓涓湁鍚戝浘錛屽熷姪鍥捐繖涓ā鍨嬫潵鍒嗘瀽闂錛屼嬌寰楅棶棰樺彉寰楀艦璞′簡璁稿銆傞渶瑕佹敞鎰忕殑鏄紝榪欑SG娓告垙瀵瑰簲鐨勬湁鍚戝浘鏄棤鐜殑錛屽洜涓哄鏋滄湁鐜紝閭d箞娓告垙鍙屾柟灝卞彲鑳藉湪鐜笂涓嶅仠鐨勮漿鎹㈢姸鎬侊紝娓告垙涓嶈兘鍦ㄦ湁闄愭緇堟錛岃繖鏍峰氨涓嶆弧瓚崇粍鍚堟父鎴忕殑鐗瑰緛3浜嗐?br>銆銆鐒惰屽湪寰堝鏃跺欎粎浠呯煡閬撴煇涓姸鎬佹槸蹇呰儨榪樻槸蹇呰觸鏄笉澶熺殑錛屽洜涓哄鏋滃瓨鍦ㄥ涓粍鍚堟父鎴忥紙姣斿緇忓吀鐨凬im錛夛紝瀵瑰簲鐨勭姸鎬侀泦鍚堥潪甯稿ぇ錛屾棤娉曠洿鎺ュ埄鐢ㄥ繀鑳滃繀璐ユ佺悊璁烘眰瑙o紝鍥犳闇瑕佺敤鍒板崥寮堣涓竴涓緢閲嶈鐨勫伐鍏鳳細SG鍑芥暟銆?br>銆銆鏌愪釜鐘舵佺殑SG鍑芥暟鍊煎畾涔変負褰撳墠鐘舵佹墍鏈変笉鍙揪鐨勭姸鎬佺紪鍙蜂腑鏈灝忕殑緙栧彿錛屽叾涓粓姝㈡佺殑SG鍑芥暟鍊兼槸0銆傛湁浜嗚繖涓伐鍏鳳紝灝卞紩鍏ヤ竴涓潪甯稿己澶х殑瀹氱悊鈥斺擲G鍒嗚В瀹氱悊錛?br> 銆銆澶氫釜緇勫悎娓告垙鐨凷G鍑芥暟鍊兼槸姣忎釜緇勫悎娓告垙鐨勫嚱鏁板肩殑鍜屻?/span>錛堣繖閲岀殑鍜屽畾涔変負寮傛垨鎿嶄綔錛?br>銆銆 銆銆SG鍒嗚В瀹氱悊鐨勮瘉鏄庝笉鏄緢闅撅紝鍏跺疄鍜孨im鐨勮瘉鏄庡緢鍍忋傛牴鎹繖涓畾鐞嗭紝鎴戜滑灝辯煡閬撲負浠涔圢im鐨勮В娉曟槸寮傛垨鎵鏈夌殑鐭沖瓙涓暟浜嗭紝鍥犱負姣忓爢鐭沖瓙鐨凷G鍊煎氨鏄煶瀛愮殑涓暟銆係G鍒嗚В瀹氱悊鍛婅瘔鎴戜滑浠諱綍SG娓告垙閮藉彲浠ヨ漿鍖栨垚Nim娓告垙鏉ュ仛銆?br>銆銆Nim涓殑涓涓彉褰㈠氨鏄嬁璧版渶鍚庝竴鍧楃煶瀛愮殑浜虹畻杈撱傞氳繃淇敼SG鐨勮綆楄鍒欙紝鍙互寰楀嚭鐩稿悓鐨勭粨璁猴紙鍥犱負褰撶煶瀛愪釜鏁版槸1鐨勬椂鍊橲G鍊間負0錛屽洜姝よ鍗曠嫭澶勭悊錛夛紱褰撶劧涔熷彲浠ュ埄鐢ㄤ竴涓彨鍋歋J瀹氱悊鐨勬柟娉曟潵鍋氾紝渚濈劧鏄澶勭悊褰撴墍鏈夊爢鐨凷G鍊間笉澶т簬1鐨勬儏鍐點?br> 銆愬崥寮堝熀鏈ā鍨嬨?br>銆銆闄や簡Nim妯″瀷錛屽緢澶氭ā鍨嬮兘鐪嬩技澶嶆潅錛屾渶鍚庨兘鍒掑綊鍒頒簡Nim妯″瀷涓婏紝鐒跺悗鍒╃敤SG鍒嗚В鏉ュ仛鐨勩傚湪璇佹槑涓ょ妯″瀷絳変環鐨勬椂鍊欙紝鍙互閫氳繃璁$畻SG鍊煎垽鏂槸鍚︾浉鍚岋紝鎴栬呴氳繃鍒ゆ柇蹇呰儨絳栫暐鐨勮蛋娉曞皢鍏惰漿鍖栦負Nim銆傝澶氭ā鍨嬮潪甯哥殑紲炲錛屽叾鑾瘋儨絳栫暐鍙堝崈宸竾鍒紝鍥犳鏃犳硶涓涓鍒椾婦錛屼絾鏄帉鎻′竴浜涚粡鍏告ā鍨嬫槸蹇呴』鐨勶紝榪欐牱閫氳繃妯″瀷鐨勮漿鍖栧彲浠ョ畝鍖栭棶棰樼殑闅懼害銆?br>銆銆緇忓吀妯″瀷1錛歂im鍙樼銆?/span>鍖呮嫭錛?br>銆銆銆銆(1)
妤兼Nim銆傛妸濂囨暟鍙伴樁鐨勭煶瀛愪綔涓篘im錛屼簩鑰呯瓑浠鳳紝鍥犱負蹇呰儨鐨勭瓥鐣ユ槸鐩稿悓鐨勩?br>銆銆銆銆(2) 姣忔鍙互鍙杒鍫嗭紝榪欎釜鏄粡鍏哥殑Moore
Nim銆傚畠鏄硾鍖栫殑Nim娓告垙銆?br>銆銆銆銆(3)
涓ゅ爢鐭沖瓙錛屾瘡嬈″彲浠ュ彇涓鍫嗘垨涓ゅ爢錛屼粠涓ゅ爢鍙栧緱鏃跺欎釜鏁板繀欏葷浉鍚岋紝璋佸厛鍙栧畬鑾瘋儨銆傝繖涓槸钁楀悕鐨勫▉浣愬か鍗氬紙錛岃窡榛勯噾鍒嗗壊鏁版湁鍏籌紝鍏蜂綋璇佹槑涓嶆槸寰堟竻妤氾紝浣嗘槸鐢⊿G鍊兼墦琛ㄥ彲浠ユ壘鍑鴻寰嬨備唬鐮佸涓嬶細
#include <cstdio> #include <algorithm> usingnamespace std; constint N =200010;
int x[N], y[N], z[N]; int main() { int n, a, b, c;
while (scanf("%d", &n) ==1&& n) { for (int i =0; i < n; i++) { scanf("%d %d %d", &a, &b, &c); x[i] = a - b; y[i] = b - c; z[i] = c - a; } sort(x, x + n); sort(y, y + n); sort(z, z + n); longlong ans =0; for (int i =0; i < n; i++) ans += (2* i +1- n) * (longlong)(x[i] + y[i] + z[i]); printf("%I64d\n", ans /2); }
#include <cstdio> #include <algorithm> usingnamespace std; constint N =10010;
int main() { int x[N], y[N], n;
while (scanf("%d", &n) ==1) { for (int i =0; i < n; i++) scanf("%d %d", &x[i], &y[i]); sort(x, x + n); sort(y, y + n); for (int i =0; i < n; i++) x[i] -= i; sort(x, x + n); int ans =0; for (int i =0; i < n /2; i++) ans += x[n-i-1] - x[i] + y[n-1-i] - y[i]; printf("%d\n", ans); }
]]>鍗氬紙璁虹殑涓浜涢鐩?/title>http://m.shnenglu.com/sdfond/archive/2009/05/31/86318.htmlsdfondsdfondSun, 31 May 2009 13:53:00 GMThttp://m.shnenglu.com/sdfond/archive/2009/05/31/86318.htmlhttp://m.shnenglu.com/sdfond/comments/86318.htmlhttp://m.shnenglu.com/sdfond/archive/2009/05/31/86318.html#Feedback0http://m.shnenglu.com/sdfond/comments/commentRss/86318.htmlhttp://m.shnenglu.com/sdfond/services/trackbacks/86318.htmlPOJ 2234 Matches Game HOJ 2533 Stone II POJ 2975 Nim HOJ 1367 A Stone Game POJ 2505 A multiplication game ZJU 3057 beans game POJ 1067 鍙栫煶瀛愭父鎴?br>POJ 2484 A Funny Game POJ 2425 A Chess Game POJ 2960 S-Nim POJ 1704 Georgia and Bob POJ 1740 A New Stone Game POJ 2068 Nim POJ 3480 John POJ 2348 Euclid's Game HOJ 2645 WNim POJ 3710 Christmas Game
POJ 3533 Light Switching Game