锘??xml version="1.0" encoding="utf-8" standalone="yes"?>
Andrew Stankevich's Contest #1
Chinese Girls' Amusement
鎺ㄧ粨璁虹洿鎺ョ畻
Reactor Cooling
鏈変笂涓嬬晫鐨勭幆褰㈡祦
New Year Bonus Grant
緇忓吀鐨勬爲褰P
Matrix Multiplication
鍖栫畝涓涓嬫帹緇撹
Nice Patterns Strike Back (Recommend)
鐘舵佸帇緙〥P鍚庣敤matrix鏉ヤ紭鍖栵紝鎴栬呯敤涓婃monthly鏃禠K鐨勬柟娉曘?br id="cyo319">
Get Out! (Recommend)
鍙互鐢ㄩ偅涓敓鎴愮幆鐨勫熀鐨凞FS,綾諱技japan閭i亾棰樸?br id="cyo322">
Beautiful People
鏈闀胯櫨綾沖簭鍒楋紝8榪囩◢寰湁涓粏鑺傝鎯?br id="cyo325">
Cracking' RSA (Recommend)
姹俠ool鏂圭▼緇勭殑瑙f暟銆傘傘備篃灝辨槸姹備笅鑷敱鍙橀噺涓暟
Andrew Stankevich's Contest #2
Non Absorbing DFA
璁板緱鏄釜寰堟甯哥殑DP銆?br id="cyo335">
The Towers of Hanoi Revisited
緇忓吀鐨刵涓鐨刪anoi錛岃寰楄DP...
Hyperhuffman
灝辨槸huffman闂鍚э紝宸茬粡鎺掑ソ搴忥紝鍙互O(n)鐨勩?br id="cyo341">
Little Jumper (Recommend)
涓嶉敊鐨勭墿鐞嗛
棣栧厛鍙互鎯寵薄鎴愪袱鍙潚铔欎竴璧蜂粠涓よ竟璺熾?br id="cyo345">
涓昏闂灝辨槸璁$畻緇欏畾涓涓獀鍚庣殑闈掕洐鍙揪鍖洪棿銆?br id="cyo346">
鍙栧埌鏈鍊煎彧鏈?縐嶆儏鍐碉細浠庝笂闈㈡摝榪囷紝浠庝笅闈㈡摝榪囷紝45搴﹁搗璺籌紙濡傛灉鍙互錛?br id="cyo347">
Quantization Problem
鍙堟槸涓涓甯哥殑DP...
Roads
緇忓吀闂浜嗐?br id="cyo353">
鐢熸垚鏍戜笂鐨勬潈鍊煎繀瀹氭槸鍑忓皯錛屽叾浠栬竟涓婄殑鏉冨煎繀瀹氬澶э紝璁懼叾鍒嗗埆涓篴i, bj
鐒跺悗瀵逛換鎰忎竴鏉′笉鍦ㄧ敓鎴愭爲涓婄殑杈癸紝鍔犲叆鍒扮敓鎴愭爲涓婂艦鎴愪竴涓幆錛岀劧鍚庤繖鏉¤竟鐨勬潈鍊煎簲褰?gt;=鐜笂鎵鏈夎竟鐨勬潈鍊箋?br id="cyo355">
鐒跺悗鎴戜滑鍙互鍒楀嚭涓鍫嗗艦濡俛i + bj >= 涓涓鏁扮殑涓嶇瓑寮忋傘傘傜劧鍚庛傘傘俴m綆楁硶鐨勬爣欏秪~~
璇︽儏鍙互鐪媖m綆楁硶鐨勮瘉鏄巭~~
Robbers
棣栧厛浠[i] = m * x[i] / y錛屽彇涓嬫暣錛岀劧鍚庡彲鑳絢[i]鐨勫拰涓嶅埌m錛岃澧炲姞涓浜沰[i]錛屽綋鐒舵槸錛屾瘡嬈℃壘澧炲ぇ鍚巇elta鏈灝忕殑~~~
涓昏鏄紝浼間箮鍙互鐢╤eap浼樺寲涓篛(nlogn)銆傘傘?br id="cyo361">
Toral Tickets (Recommended)
姣旇緝紲炲鐨凱olya
Andrew Stankevich's Contest #3
Areas (Recommended)
鎴戠殑鍋氭硶鏄熀浜庡崐騫抽潰浜ょ殑錛屽姣忔潯鐩寸嚎錛屾灇涓句嬌鐢ㄥ畠宸﹁竟鐨勫崐騫抽潰榪樻槸鍙寵竟鐨勫崐騫抽潰錛屾渶鍚庡鏋滄槸涓涓湁闄愬鉤闈㈠垯榪斿洖銆傘傘?br id="cyo370">娉ㄦ剰鎼滅儲榪囩▼涓綋鍗婂鉤闈㈣鍒囩┖鍚庡氨鍙互return錛岀敱浜庢渶鍚庡彧鏈塐(n^2)鍧楋紝鎵浠ュ鏉傚害鏄疧(n^4)鐨勶紙浣跨敤O(n^2)鐨勫崐騫抽潰浜わ級
SGU涓婃椂闄愬緢瀹斤紝ZJU涓婅繖涔堝仛鏃墮棿鏈夌偣绱э紙鎴?.95s AC鐨?_-bbbbbbb錛?br id="cyo372">
Beloved Sons
鎸夊亸鐖辯▼搴︿粠澶у埌灝忔壘澧炲箍璺窇max_match灝卞彲浠ヤ簡銆傘傘?br id="cyo375">
Strange Counter
鏋勯?br id="cyo378">
緇存姢榪欎箞涓涓ц川涓や釜2涔嬮棿鑷沖皯鏈変竴涓?銆傘傘傜劧鍚庛傘傘傝璁恒傘傘?br id="cyo379">
Data Transmission (In List)
鎹鏄嫻?+ 浣垮姴浼樺寲...(by Lunarmony)
Strong Defence
鍡紝棣栧厛棰滆壊鏁頒笉浼氳秴榪囦換浣曚竴鏉¤礬鐨勯暱搴︽槸鎶娿傘傘傛墍浠ラ鑹叉暟鑷沖灝辨槸鏈鐭礬鐨勯暱搴︺?br id="cyo385">
鐒跺悗鎴戜滑璺慸ijstra鐨勬椂鍊欐妸杈圭潃涓婇鑹插氨鏄簡銆傘傘?br id="cyo386">
Weird Dissimilarity
緇忓吀鐨凞P
PL/Cool
鎹鏄ā鎷?from oibh)銆傘傘?br id="cyo392">
Royal Federation (In List)
鎹鏄瀯閫? not AC yet.
Two Cylinders
鍐欏嚭縐垎寮忓悗romberg.
Andrew Stankevich's Contest #4
The Smart Bomb
綆鍗曠殑鎺ㄤ竴涓嬨?br id="cyo3104">
I Just Called ...
妯℃嫙錛岃鐢═rie鏍戙?br id="cyo3107">
Order-Preserving Codes
妯′豢huffman閭f牱錛屽彧鏄瘡嬈erge鐩擱偦鐨勩?br id="cyo3110">
More Divisors
緇忓吀鐨凞P, f[i][j]鐢ㄥ墠i涓礌鏁板緱鍒癹涓害鏁扮殑鏈灝忔暟銆傘傘?br id="cyo3113">
Long Dominoes
鐘舵佸帇緙〥P
The Magic Wheel
搴旇閫夋嫨絎竴涓偣錛岀劧鍚庡鎵句笅涓灞傜殑涓や釜鏂瑰悜鏈榪戠殑閮借瘯涓涓嬪氨琛屼簡銆侽(N)
Cracking SSH
DP...
Periodic Tilings
濂藉儚鏌愬勾final鏈夌被浼肩殑棰樸傚簲璇ユ湁緇撹鐨勮銆?br id="cyo3125">
Not AC yet
Trade (In List)
Not AC yet, 鍙互鐪嬬湅
Counting Triangulations (Recommended)
涓閬撹繕綆椾笉閿欑殑DP棰橈紝8榪囬鐩弿榪板ソ鍍忔湁鐐逛笉娓呮垜璁板緱銆?br id="cyo3132">
Unfair Contest
鎼滅儲+妯℃嫙
Andrew Stankevich's Contest #5
Unique Attack (Recommended)
鍒ゆ柇鏈灝忓壊鏄惁鍞竴鐨勯錛屽氨鏄敤涓ょ鏂規硶鏋勯犳槸鍚︿竴鏍楓?br id="cyo3142">
Burning Bridges
ms鏄緢緇忓吀鐨勭敤妗ユ潵浣滅殑棰?br id="cyo3145">
Circles
緇忓吀鐨勫鉤闈㈠浘嬈ф媺鍏紡棰?br id="cyo3148">
Linear Programming Dual
濂借薄鏄嚎鎬ц鍒掞紝Not AC yet
DVD (In List)
鐩稿綋瀹規槗鍐欓敊鐨凞P棰樸?br id="cyo3154">
Think Positive
璁板緱鍙互O(n)鎵弿鐨勩?br id="cyo3157">
Ranking
楹葷儲鐨勬ā鎷熼銆?br id="cyo3160">
Driving Straight
涔熸槸寰堢粡鍏哥殑鎬濊礬浜嗭紝鍏圖P(鎴栨洶BFS)銆傜劧鍚庤蛋涓閬嶏紝鍦ㄦ弧瓚蟲湁瑙g殑鍓嶆彁涓嬪敖閲忓線閭d釜鏂瑰悜璧般?br id="cyo3163">
Andrew Stankevich's Contest #6
Ackerman's Function (Recommended)
鍙互璁や負鏄壘瑙勫緥
The Minimal Angle
璁板緱瑕丱(n)錛屽彇騫沖潎鏁拌繕鏄粈涔堥兘鍙互銆?br id="cyo3172">
Yellow Code
鎴戣寰楄繕鏄瘮杈冨鏄揧Y涓涓瀯閫犵殑銆傘傘?br id="cyo3175">
Yet Another Digit
DP鍚с?br id="cyo3178">
Graduated Lexicographical Ordering (In List)
綾諱技浜巚ietnam鐨勯偅閬撻銆傘傘傜浉褰撻夯鐑︺傘傘傚緩璁疄鐜頒笅銆傘傘?br id="cyo3181">
GSM
楂樼簿搴﹀紑鏂歸銆傛垨鑰呮墦琛綖
Warehouse Keeper (In List)
KM,8榪囨垜璁板緱瀹規槗T?
Don't Go Left
璁板緱鍙堟槸涓涓姸鎬佹満鐨凚FS棰?br id="cyo3190">
Railroad Sort
寰堟湁鎰忔濈殑鏋勯狅紝澶т綋鎬濊礬鏄瘡緇忚繃涓涓猻tation錛岀暀浣忓悗涓鍗婏紝鏀捐鍓嶄竴鍗娿傘傘俷涓濂界粰2^n涓暟鎺掑簭銆?br id="cyo3193">
Andrew Stankevich's Contest #7
Little Brackets
緇忓吀鐨刣p, NOI闄ㄧ煶鐨勭瀵嗙畝鍖栫増銆傘傘?br id="cyo3199">
f[n][k] = n瀵規嫭鍙鳳紝<=k灞?br id="cyo3200">
f[n][k] = sigma(f[m][k] * f[n - m - 1][k - 1])錛岃緭鍑篺[n][k] - f[n][k - 1]
灝辨槸姣忔娣誨姞涓鏁翠釜鎷彿鍧椼?br id="cyo3202">
Under Control (In List)
杞崲鍧愭爣紱繪暎鍖栧惂
綾諱技鎬濊礬鏈夐亾瓚呯駭澶嶆潅鐗?a id="cyo3206">Soldier
Holidays (In List)
Not AC Yet
Laboratory
璁板緱鍒楀嚭寮忓瓙璋冩暣涓嬪氨琛屼簡銆傛椂闄愬悡浜虹殑锝?br id="cyo3213">
Maps
Crazy Painter
Puzzle
娌¤閿欑殑璇滲FS涓涓嬪惂銆傘傘?br id="cyo3220">
Quest
緇忓吀鐨勭姸鎬佸帇緙〣FS錛岃緭鏂規鏈夌偣楹葷儲銆傘傘?br id="cyo3223">
Stable Sets
]]>
And Then There Was One
緇忓吀棰橈紝閫掓帹銆?br id="vzoi3">
Prime Gap
綆鍗曢
Minimal Backgammon
DP
Lowest Pyramid
姣旇緝楹葷儲鐨勯鐩紝澶т綋鍋氭硶鏄灇涓句竴涓偣錛屾牴鎹窛紱葷浉絳夊彲浠ユ灇涓懼彟涓涓偣錛堣繖浜涚偣寰堝皯浜嗭級錛岀劧鍚庣‘瀹氫笅鏈鍚庝竴涓偣錛宑heck.
Geometric Map
姣旇緝楹葷儲鐨勯澶勭悊 + dijstra
Slim Span
緇忓吀闂浜嗭紝鎸夎竟澶у皬鎺掑簭錛屾瘡嬈″姞涓鏉¤竟錛屽鏋滃艦鎴愮幆鍘繪帀鐜笂鏈灝忕殑杈廣俢heck
The Morning after Halloween
BFS錛屾渶鍚庣敤A*榪囨帀鐨勩傜敤max(褰撳墠浣嶇疆鍒扮洰鏍囦綅緗?浼頒環
Bug Hunt
綆鍗曟ā鎷?br id="vzoi24">
Most Distant Point from the Sea
鍙互鐢ㄤ簩鍒嗭紜鍗婂鉤闈氦銆?br id="vzoi27">浣嗕篃鍙互鎯寵薄鎵鏈夎竟鏈濋噷闈㈡尋鍘嬶紝榪欐牱鏈鍚庤涔堟槸涓ゆ潯杈瑰帇鍒頒竴璧鳳紝瑕佷箞涓夋潯杈瑰帇鎴愪竴涓偣銆侽(n^3)鏋氫婦銆?br id="vzoi28">
The Teacher's Side of Math
娉ㄦ剰鍒皃,q閮芥槸璐ㄦ暟錛屾墍浠ョ瓟妗堟槸0蹇呴』鏄墍鏈夊叾浠栭」緋繪暟鍏ㄤ負0錛岃繖鏍峰氨鍙互瑙f柟紼嬩簡銆?br id="vzoi31">鐢╨ong double + 鏈澶т富鍏冩硶鍙互榪囥?br id="vzoi32">
]]>
BEATBIT
涓FA鏄惁鍚屾瀯錛宐fs or 鍒ゆ柇鏍戞槸鍚﹀悓鏋勯兘鍙互錛堝洜涓轟繚璇佷簡鍙互緇堟鎵浠ユ病鏈夌幆瀛樺湪錛?br id="s_1y5">
Prester John
棰樻剰娌¤娓咃紝璧拌礬鐨勬柟寮忕被浼間簬NFA, BFS灝辮浜嗐?br id="s_1y9">涓嶈繃鍙互鍑轟釜鏁版嵁璁╂墍鏈夌▼搴廡...
Robotruck
O(N*C)鐨凞P
Jumping Hero
BFS錛屾渶澶?00 * 300 * 5000 * 5縐嶇姸鎬侊紝褰撶劧瀹為檯涓婅繙榪滀笉鍒般?br id="s_1y18">
Board Game
Bellman-Ford
The Bridges of Kolsberg
緇忓吀DP
The Finest Chef
鏈浼樻潈鍖歸厤
IP-TV
MST
Ladies' Choice
紼沖畾濠氬Щ
]]>
Bachelor
Arithmetic
縐掓潃棰?/span>
Nested
Squares
妯℃嫙棰?/span>
The
Dumb Grocer
棣栧厛瑕佹湁1鏄惂銆傘傘傜劧鍚庢垜浠寜鐓?/span>1鐨勪釜鏁版潵鍒嗙被錛屾垜浠潵璁$畻鎭版湁k涓?/span>1鐨勬柟妗堟暟銆?/span>
鎴戜滑鍦?/span>k涓?/span>1鐨勫熀紜涓婂姞鍏ユ柊鐨勬暟錛屾樉鐒剁涓涓暟鍙兘鏄?/span>k+1
鐒跺悗鍔犲叆鐨勬暟鍙兘鏄?/span>k + 1
or 2 * (k + 1)
濡傛硶鐐埗銆傘傘傚彂鐜伴潪1鐨勬暟閮藉叿鏈?/span>(k + 1) * t鐨勫艦寮忋傘傘傝鍏朵緷嬈′負(k + 1) * ti
鍒?/span>{ti}榪欎簺鏁頒篃婊¤凍棰樼洰鐨勬ц川銆傘傘傚叡鏈?/span>f((n - k) / (k + 1))縐嶆柟妗堛?/span>
璁?/span>f(n)鏄姹傜殑鍑芥暟錛屽垯f(n) = sigma(f((n - k) / (k
+ 1)), (k + 1) | (n + 1) , k>=
榪欐牱鐩存帴鍋氫細T...
鎴戜滑浠?/span>g(n) = f(n
- 1)
鍒?/span>g(n) = f(n -
1) = sigma(f((n - k - 1) / (k + 1))) = sigma(f(n / (k + 1) - 1)) = sigma(g(n /
(k + 1)), (k + 1) | n, k >= 1
璁?/span>n = p1^a1 *
p2^a2 * ... * pr*ar
浠?/span>h(p1, p2,..,
pr, a1, a2...ar) = g(n)
= h(p1,p2, ...pr, b1, b2, ...br),
0<=bi <= ai, bi涓嶅叏=ai
娉ㄦ剰瀵逛簬涓涓‘瀹氱殑n錛?/span>h()涓殑p1, p2...pr鍦ㄨ綆楄繃紼嬩腑濮嬬粓涓嶅彉銆傘傘傛墍浠ャ傘傘?strong>璁$畻緇撴灉涓?/strong>pi鏃犲叧,鍙笌ai鏈夊叧
榪欐牱鐘舵佹暟灝卞ぇ澶у噺灝戜簡銆傘傘傜洿鎺ュ洜寮忓垎瑙e悗dp灝辮浜嗐傘傘?/span>
ACM
Puzzles
鐘舵佸帇緙?/span>dp
銆?/span>The
Bells are Ringing銆?/span> Photographic
Tour
榪欎笁棰樺ソ鍍忓綋鏃舵病鍐?/span>summary銆傘傘傛墍浠ユ垜浠亣璁炬瘮杈冪畝鍗曪綖锝烇綖
You
are around me ...
棣栧厛鏃嬭漿鍧愭爣錛屽彉鎴愬鉤琛屼笌xy杞寸殑妞渾錛岀劧鍚庡潗鏍囦幾緙┿傘傘傚彉鎴愬渾銆傘傘傛渶榪戠偣瀵廣傘傘傝創妯℃澘銆傘傘?/span>
ZJU2107 Quoit Design
涓閬撴祴鏈榪戠偣瀵圭殑棰樸?/span>
Infinite
Matrix
鏄劇劧錛屽浜庡浐瀹氱殑j, Ri,
j鏄竴涓叧浜?/span>i鐨勫欏瑰紡銆?/span>
娉ㄦ剰鍒版暟鍒?/span>Ri, j鐨勫樊鍒嗗簭鍒?/span>R(i + 1, j) - R(i, j)鏄彲浠ユ眰鍑烘潵鐨勶紙鍒╃敤Mj, k <= 10鐨勬潯浠訛紝鍙互鍦?/span>O(10*n^2)鐨勬椂闂村唴綆楀嚭錛?/span>
鐒跺悗鏈変簡宸垎搴忓垪姹傞氶」灝辨槸O(n^2)鐨勪簨鎯呫?/span>
鐒跺悗璁?/span>S(p, j)(n)
= Sigma(i^p * R(i, j)) i <= n
緇х畫鍒╃敤宸垎搴忓垪涔嬬被鐨勬柟娉曟眰榪欎釜錛屾渶鍚庡啀姹備竴涓?/span>Sum_S(p, j)
棰勫鐞嗗鏉傚害澶ц嚧鏄?/span>O(10*n^3)鐨勩?/span>
鍚庨潰鐨勫氨濂藉姙浜嗭紝瀵規瘡涓闂紝鎶?/span>(i + 1)^p浜岄」寮忓睍寮錛屾渶澶?/span>10欏癸紝鐒跺悗鍒╃敤鍏紡鐩存帴璁$畻銆?/span>
澶勭悊璇㈤棶澶嶆潅搴?/span>O(p*q*n)
POJ3529 Matrix
Analysis錛岀被浼肩殑鎬濇兂錛屾洿綆鍗曪綖
Magnetic
Train Tracks
緇欏畾n涓偣錛屾眰鍙互鏋勬垚澶氬皯涓攼瑙掍笁瑙掑艦銆?/span>
n <= 1200
璇濊姹傞攼瑙掍笁瑙掑艦涓嶅お濂界畻鏄惂銆傘傘傝ˉ闆嗚漿鎹紝鎴戜滑鏉ユ眰閽濊/鐩磋涓夎褰?/span>
<=> 姹傞挐瑙?/span>/鐩磋涓暟銆傘傘?/span>
鍚庨潰鐨勪簨鎯呭氨綆鍗曚簡錛屾槸瀵規瘡涓偣錛屽皢鍏朵粬鐐規寜鐓ф瀬瑙掓帓搴?/span> + 鎵弿銆?/span>
Dhaka
2005 Counting Triangles 涔熸槸涓閬撹ˉ闆嗚漿鎹㈢殑棰橈綖錛堣漿鍖栨垚姹備笁鐐瑰叡綰跨殑涓暟錛?/span>
Shanghai 2004
Amphiphilic Carbon Molecules 涔熸槸涓閬撴瀬瑙掓帓搴?/span>+鎵弿鐨勯銆?/span>
Who wins?
Chomp belongs to the category of impartial 2-player perfect information games.
It turns out that for any rectangular starting position bigger than 1 × 1 the 1st player can win. This can be shown using a strategy-stealing argument: assume that the 2nd player has a winning strategy against any initial 1st player move. Suppose then, that the 1st player takes only the bottom right hand square. By our assumption, the 2nd player has a response to this which will force victory. But if such a winning response exists, the 1st player could have played it as his first move and thus forced victory. The 2nd player therefore cannot have a winning strategy.
Computers can easily calculate winning moves for this game on two-dimensional boards of reasonable size.