IOITRAIN Problems

SPOJ Booklet
file:///C:/Users/minhduc/Desktop/IOITRAIN-main.html
1 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Archives of the Vietnam Online Judge - IOI Training

main problemset
Editors:
Ng Minh c Phm Quang V Sherry Bi Nguyn Tng Problem setters of VN_SPOJ My Own Way Kaiel
Last updated: 2008-04-02 17:27:50
Preface
This electronic material contains a set of algorithmic problems, forming the archives of the Vietnam Online Judge - IOI Training (http://www.spoj.pl/IOITRAIN/), main problemset. The document can be accessed at the following URLs: in PostScript format: http://www.spoj.pl/IOITRAIN/problems/main.ps in Portable Document Format: http://www.spoj.pl/IOITRAIN/problems/main.pdf These resources are constantly updated to synchronise with the ever-changing hypertext version of the problems, and to include newly added problems. If you have obtained this document from another source, it is strongly recommended that you should download the current version from one of the aforementioned URLs.
Enjoy problem-solving at the Vietnam Online Judge - IOI Training!
2 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Disclaimer from the Editors. Despite our best efforts, it is possible that this document contains errors or that some of the content differs slightly from its original hypertext form. We take no responsibility for any such faults and their consequences. We neither authorise nor approve use of this material for any purpose other than facilitating problem solving at the Sphere Online Judge site; nor do we guarantee its fitness for any purpose whatsoever. The layout of the problems in this document is the copyright of the Editors named on the cover (as determined by the appropriate footers in the problem description). The content is the copyright of the respective Editor unless the copyright holder is otherwise stated in the 'resource' section. The document as a whole is not protected by copyright, and fragments of it are to be regarded independently. No responsibility is taken by the Editors if use or redistribution of this document violates either their or third party copyright laws. When referring to or citing the whole or a fragment of this document, please state clearly the aforementioned URLs at which the document is to be found, as well as the resources from which the problems you are referring to originally came. Remarks concerning this document should be sent to the following e-mail address: contact@spoj.pl.
Table of Contents
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19.
3 of 90
Problem NKBUS (2117. Bus) Problem NKTEST (2163. Kim tra chng trnh) Problem STEEL (2166. Khun thp) Problem NKREZ (2187. Hi trng) Problem NKBUSD (2196. iu xe but) Problem NKTHEME (2197. on cao tro ca bn nhc) Problem NKLINEUP (2210. Xp hng) Problem NKDISNEY (2231. Cng vin Disneyland) Problem NKGOLF (2232. Sn golf) Problem NKONEARC (2243. Mng my tnh) Problem NKRACING (2245. Vng ua F1) Problem NKMSG (2248. Truyn tin) Problem NKMAXSEQ (2250. Dy con di nht) Problem NKPATH (2251. ng i trn li) Problem NKA1 (2253. A1) Problem NKPOLY (2259. Chia a gic) Problem NKTOSS (2262. Tung ng xu) Problem NKINV (2263. Dy nghch th) Problem NKLP (2267. Hon v di nht)
4/5/2008 10:00 PM
SPOJ Booklet
20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. 55. 56.
Problem NKMINES (2292. Tr chi d mn) Problem NKLIGHT (2305. H thng n) Problem NKDEC (2307. Trang tr dn n) Problem NKRAIN (2336. Ma thin thch) Problem NKCAT (2341. Dy Catalan) Problem NKNLACE (2342. Chui ht) Problem NKBRK2 (2343. Dy ngoc bc K) Problem NKNET (2348. Mng truyn tin) Problem NKLEAGUE (2367. Gii bng ) Problem NK2MFS (2368. Lp lch trn hai my) Problem LQDBUS (2377. n trng) Problem NKSGAME (2401. VOI08 Tr chi vi dy s) Problem NKJUMP (2402. VOI08 L c) Problem NKGIFTS (2403. VOI08 Qu tt) Problem V8ORG (2535. T chc i lp) Problem V8SCORE (2536. Chm im) Problem V8SORT (2547. Sp xp) Problem V8MAYORS (2548. Th trng) Problem IOIHELP (2553. IOITRAIN - ng gp, thc mc) Problem VROOKS (2554. Qun xe) Problem VKNIGHTS (2555. Qun m) Problem VPERM (2556. Hon v cp s cng) Problem VWORDS (2557. Tng ng ha hai t) Problem SAFENET2 (2574. Mng my tnh an ton) Problem LEM (2578. RIVER) Problem SUMS (2580. S ph thuc) Problem PBCPOINT (2582. Ni im) Problem LEM1 (2583. COIN) Problem PBCWAYS (2584. Tr chi di chuyn con tt) Problem PAIRVIS (2586. Help Conan !) Problem LEM2 (2589. GUMBI) Problem PASSWORD (2597. Password) Problem VNBRACK (2600. Dy ngoc bc P) Problem LSPITO (2602. Help Conan ! (version 3)) Problem MEO (2603. Mo) Problem CHATCHIT (2604. Chat chit) Problem CONANSP (2605. Conan Needs Help Again (Help Conan 4 )!)
4 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2117. Bus
Problem code: NKBUS
Mt xe but ca cng ty c nhim v n nhn vin n tr s lm vic. Trn hnh trnh, xe but s tip nhn nhn vin ng ch cc im hn nu nh xe cn ch trng. Xe but c th li ch nhng cng nhn cha kp n im hn. Cho bit thi im m mi nhn vin n im hn ca mnh v thi im qua mi im hn ca xe but. Gi thit rng xe but n im hn u tin ti thi im 0 v thi gian xp khch ln xe c bng 0. Xe but cn phi ch mt s lng nhiu nht cc nhn vin c th c n tr s. Hy xc nh khong thi gian ngn nht xe but thc hin cng vic.
D liu vo
Dng u tin cha 2 s nguyn dng n, m theo th t l s im hn v s ch ngi ca xe but Dng th i trong s n dng tip theo cha s nguyn ti l thi gian cn thit xe but di chuyn t im hn th i n im hn th i+1 (im hn th n+1 s l tr s lm vic ca cng ty) v s nguyn k l s lng nhn vin n im hn i, tip theo k s nguyn l cc thi im n im hn ca k nhn vin.
Kt qa
Gm mt dng duy nht, l thi gian ngn nht tm c.
Gii hn
1 n 200000, 1 m 20000 Tng s nhn vin khng vt qu 200000. Kt qu khng vt qu 231-1.
V d
D liu mu 3 2 3 2 4 3 1 3 6 3 7 5 1 5 Kt qa 10
Gii thch: Trn ng n cng ty c 3 trm xe but. T trm 1 n trm 2, trm 2 n trm 3, v t trm 3 n cng ty ln lt mt 3, 1 v 5 n v thi gian. Xe but c th i nh sau: n thng trm 2, n ngi th 2, n trm 3, ch 1 n v thi gian n ngi duy nht trm ny, v cui cng n cng ty. Tng cng xe but i mt 3 + 1 + 1 + 5 = 10 n v thi gian. Added by: Ng Minh c
5 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Date: Time limit: Source limit: Languages: Resource:
2007-11-30 2s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Adapted from Ukrainian OI 2000
6 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2163. Kim tra chng trnh

Problem code: NKTEST
Test tuy khng phi l phng php chng minh tnh ng n ca chng trnh, nhng vn c s dng rng ri pht hin li sai v tng tin cy. C nhiu phng php hiu chnh chng trnh, nhng ni dung ch yu vn da trn c s chn cc b tests i vo cc nhnh khc nhau ca chng trnh. Cho m t chng trnh di dng cc dng lnh. Cc lnh tuyn tnh c k hiu l S, lnh r nhnh khng y c xc nh bi 2 cu lnh IF v END_IF, lnh r nhnh y c xc nh bi 3 cu lnh IF, ELSE, v END_IF. iu kin sau IF c b qua trong m t. Chng trnh kt thc bng lnh ENDPROGRAM. Yu cu: xc nh s lng tests cn thit kim tra tt c cc nhnh ca chng trnh.
D liu
Gm nhiu dng, m t mt chng trnh theo nh dng nu.
Kt qa
Gm 1 dng duy nht, cha s lng tests cn thit kim tra tt c cc nhnh ca chng trnh.
Gii hn
Kt qu khng vt qu 231-1
V d
D liu: S IF S S ELSE IF IF S ELSE S END_IF S ELSE S END_IF END_IF S ENDPROGRAM Kt qa 4 D liu: S IF
7 of 90
4/5/2008 10:00 PM
SPOJ Booklet
END_IF ENDPROGRAM Kt qa 2 D liu: S S ENDPROGRAM Kt qa 1
Added by: Date: Time limit: Source limit: Languages: Resource:
Ng Minh c 2007-12-01 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT UVA
8 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2166. Khun thp

Problem code: STEEL
chuNn b cho L hi k nim 30 nm ngy Chin dch H Ch Minh ton thng, gii phng min Nam, thng nht t nc, ngi ta cn gia cng cc loi khun thp c hnh dng l cc hnh a gic li M nh. Mi khun thp c thit k trn mt tm thp cng c hnh dng l mt hnh a gic li N nh, khng c cnh no ca khun thp nm gn trn mt cnh ca tm thp. tin cho vic gia cng, khun thp c v sao cho hai ng thng cha hai cnh khng k nhau ca n khng ct nhau bn trong tm thp. Cng vic chnh cn lm trong qu trnh gia cng l s dng my ct ct c khun thp t tm thp ra. R rng l cn phi thc hin M nht ct. Mi nht ct c thc hin bng cch chn mt cnh no ca khun thp v ct theo ng thng cha cnh y chia tm thp thnh hai phn, mt phn cha khun thp cn gia cng. Chi ph ct khun thp l tng chiu di ca cc ng ct.
Trn hnh 1 v 2, tm thp l t gic c t nht, khun thp l hnh vung c t bng cc gch m. Cc nt gch t l cc ng ct vi tng chi ph bng 6.5 n v. Yu cu: Cho bit hnh dng tm thp v khun thp cn gia cng. Hy tm phng n ct khun thp c chi ph nh nht.
D liu
Dng u ghi s N l s nh ca tm thp; dng tip theo, mi dng ghi 2 s thc x v y, l to N nh ca tm thp c lit k theo chiu kim ng h bt u t mt nh no ; dng tip theo ghi s M l s nh ca khun thp; cui cng l M dng, mi dng ghi 2 s thc x v y l to M nh ca khun thp c lit k theo chiu kim ng h bt u t mt nh no . Cc s trn mt dng cch nhau t nht mt du cch.
Kt qa
Gm mt dng duy nht l chi ph nh nht tm c vi chnh xc ti 4 ch s sau du chm thp phn.
9 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Gii hn
3 N 2000 3 M 2000 -104 < x, y < 104
V d
D liu: 4 2 1 2 5 5 3.5 5 2 4 3 3 3 4 4 4 4 3 Kt qa 6.5000
Ng Minh c 2007-12-01 2s 50000B C C++ PAS gpc PAS fpc JAVA TEXT thi quc gia 2005
10 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2187. Hi trng
Problem code: NKREZ
Nh trng c mt phng hi trng. C nhng yu cu mun s dng phng hi trng ny, mi yu cu cho bit thi im bt u v thi im kt thc. Nh trng c th chp nhn hoc t chi i vi mt yu cu. Yu cu: hy gip nh trng chn cc yu cu s dng hi trng sao cho tng thi gian hi trng c s dng l ln nht.
D liu
Dng u tin cha mt s nguyn dng n (n 10000), s yu cu. Mi dng trong s n dng tip theo cha 2 s nguyn dng p v k (0 p < k 30000), m t mt yu cu bt u ti thi im p v kt thc ti thi im k.
Kt qa
Gm mt dng duy nht l tng thi gian ln nht m hi trng c s dng
V d
D liu: 12 1 2 3 5 0 4 6 8 7 13 4 6 9 10 9 12 11 14 15 19 14 16 18 20 Kt qa 16
Added by: Date: Time limit: Source limit: Languages:
Ng Minh c 2007-12-04 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT
11 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2196. iu xe but
Problem code: NKBUSD
Tho lun
C n xe but chy trn tuyn l mt ng vng khp kn c di S. Cc xe but c nh s t 1 n n theo th t ni ui nhau trn tuyn ng. Xe s 1 chy sau xe s n. Cc xe chy cng vi vn tc V0 v khong cch gia hai xe lin tip l nh nhau. C k xe but ng thi ri khi tuyn. tr li khong cch u nhau gia cc xe, cn phi c mt khong thi gian t v mt s xe cn phi thay i tc . Trong khong thi gian ny, cc xe phi chy vi tc khng i trong khong [Vmin, Vmax] theo lnh ca trung tm. Ht khong thi gian t cc xe li quay v vn tc V0. Yu cu: gip trung tm tm khong thi gian b nht Tmin khi phc s cn bng khong cch gia hai xe lin tip trn tuyn v vn tc ca mi xe trong khong thi gian y. Bit rng, trong qu trnh iu chnh, khng c xe no vt qua xe trc mt.
D liu vo
Dng th nht cha N, K ,S , Vmin, Vmax, V0. Dng th hai cha K s nguyn dng c ghi theo th t tng dn l ch s ca cc xe ri khi tuyn. Cc d liu trn cng mt dng c ghi cch nhau bi t nht mt du cch.
Kt qa
Dng u tin: Tmin Mi mt trong s N-K dng tip theo cha hai s, s th nht l ch s ca xe but, s th hai l tc ca n trong khong thi gian Tmin. Cc dng ny phi sp xp theo th t tng dn ca ch s xe but.
Gii hn
K < N < 10000 S 10000 Vmin < Vmax 10000 Vmin V0 Vmax
V d
D liu mu 4 1 60 21 70 60 3 Kt qa
12 of 90
4/5/2008 10:00 PM
SPOJ Booklet
0.2041 1 45.5 2 70 4 21 D liu mu 4 2 40 30 80 50 2 4 Kt qa 0 1 50 3 50
Ng Minh c 2007-12-05 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Russian OI
13 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2197. on cao tro ca bn nhc

Problem code: NKTHEME
Trong mt bn nhc thng c nhng on nhc c s dng nhiu ln (t nht 2 ln). Nhng on gi l "on cao tro". Do c th s dng nhiu ging khc nhau (son, la, si...) nn nt u tin ca cc ln xut hin c th khc nhau, nhng chnh lch cao gia hai nt lin tip th nh nhau. Chng hn 1 2 5 4 10 v 4 5 8 7 13 c coi l th hin mt on cao tro, v chng cng chnh lch cao : +1,+3,-1,+6. Trong mt bn nhc, on cao tro cn phi tha mn nhng iu kin: on cao tro phi c t 5 nt nhc tr ln. Nhng ln xut hin ca on khng c chng ln nhau (khng c nt nhc chung). Yu cu: Cho mt bn nhc, tm on cao tro di nht.
D liu vo
Dng 1: cha s nguyn n, s nt nhc (n 5000). Mt s dng sau cha n s nguyn trong phm vi 1..88, th hin n nt nhc.
Kt qa
In ra 1 dng duy nht cha 1 s nguyn l di on cao tro di nht. Nu khng tm c on cao tro, in ra 0.
V d
D liu mu 30 25 27 30 34 39 45 52 60 69 79 69 60 52 45 39 34 30 26 22 18 82 78 74 70 66 67 64 60 65 80 Kt qa 5
5 nt cui dng 1 v 5 nt u dng 2 th hin on cao tro di nht. Added by: Date: Time limit: Source limit: Languages: Resource: Ng Minh c 2007-12-06 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT SPOJVN
14 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2210. Xp hng
Problem code: NKLINEUP
Hng ngy khi ly sa, N con b ca bc John (1 N 50000) lun xp hng theo th t khng i. Mt hm bc John quyt nh t chc mt tr chi cho mt s con b. n gin, bc John s chn ra mt on lin tip cc con b tham d tr chi. Tuy nhin tr chi din ra vui v, cc con b phi khng qu chnh lch v chiu cao. Bc John chuNn b mt danh sch gm Q (1 Q 200000) on cc con b v chiu cao ca chng (trong phm vi [1, 1000000]). Vi mi on, bc John mun xc nh chnh lch chiu cao gia con b thp nht v cao nht. Bn hy gip bc John thc hin cng vic ny!
D liu
Dng u tin cha 2 s nguyn N v Q. Dng th i trong s N dng sau cha 1 s nguyn duy nht, l cao ca con b th i. Dng th i trong s Q trong tip theo cha 2 s nguyn A, B (1 A B N), cho bit on cc con b t A n B.
Kt qa
Gm Q dng, mi dng cha 1 s nguyn, l chnh lch chiu cao gia con b thp nht v cao nht thuc on tng ng.
V d
D liu: 6 3 1 7 3 4 2 5 1 5 4 6 2 2 Kt qa 6 3 0
Ng Minh c 2007-12-15 2s 50000B C C++ PAS gpc PAS fpc JAVA TEXT USACO JAN07 - Gold Division
15 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2231. Cng vin Disneyland

Problem code: NKDISNEY
Bm v Cui c mi n vui chi min ph ti cng vin Disneyland nhn dp cng vin ny c khai trng ti thnh ph Mt trng. Trong cng vin c tt c n t im vui chi (c nh s t 1 n n). Trc khi i Bm v Cui ha s chp nh tt c cc t im c trong cng vin gii thiu cho cc bn cng lp. V s lng t im qu ln m thi gian li hn hp, nn Bm v Cui quyt nh thc hin vic do qua tt c cc t im chp nh theo qui tc sau y: Cng xut pht ti t im 1. Mi t im phi c t nht 1 ngi do qua. Mi ngi s thm cc t im theo th t tng dn ca ch s. Khi kt thc, mi ngi t t im cui cng trn ng i ca mnh phi quay v ni xut pht m khng c i qua bt c t im no khc. Yu cu: Cho bit tij l thi gian i t t im i n t im j (i, j = 1,2,...,n), hy xc nh gip Bm v Cui cch thc hin cch i tun th qui tc nu sao cho tng thi gian m hai ngi phi i l nh nht.
D liu
Dng u tin cha s nguyn dng n. Dng th i trong s n dng tip theo ghi cc s nguyn dng ti1, ti2, ..., tin, i = 1,2, ..., n. Cc s trn cng mt dng c ghi cch nhau bi du cch.
Kt qa
In ra 1 s nguyn duy nht l tng thi gian nh nht tm c.
Hn ch
Trong tt c cc test: 1 n 200; tij 32000, i, j = 1,2, ..., n. C 50% s lng test vi n 100.
V d
D liu: 4 0 1 1 3 1 0 2 8 1 2 0 6 3 8 6 0 Kt qa 10
16 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Ng Minh c 2007-12-19 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Chn i tuyn QG 2006
17 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2232. Sn golf
Problem code: NKGOLF
Sau nhiu ln tham gia k thi Icamp v ginh c nhiu gii thng, KAT quyt nh u t s tin ny xy dng mt sn golf mang tn mnh. Sn golf m KAT nh xy nm trong khun vin mt khu t hnh ch nht kch thc M x N c chia thnh li M hng v N ct, cc hng c nh s t 1 n M t trn xung di, cc ct c nh s t 1 n N t tri sang phi. t ti hng i, ct j c cao l Hij. KAT s chn mt hnh ch nht con gm cc t thuc li xy sn golf sao cho vi hnh ch nht con ny th cc s trn 1 hng bt k tnh t tri sang phi, cc s trn 1 ct bt k tnh t trn xung di u c cao khng gim. Sau , KAT s t l golf ti gc tri trn v v tr bt u nh ti gc phi di ca hnh ch nht khi nh, qu bng lun ln xung l. Bn hy gip KAT chn c sn golf c din tch ln nht tha mn yu cu trn.
D liu
Dng u tin ghi 2 s nguyn dng M v N l s hng v s ct ca khu t. Dng th i trong s M dng tip theo ghi N s nguyn Hi1, Hi2, .., HiN m Hij l cao t ti hng i, ct j.
Kt qa
Ghi ra 1 s nguyn duy nht l din tch ln nht ca khu t chn c.
Gii hn
1 M, N 1000 |Hij| 109
V d
D liu: 3 4 9 2 4 8 3 5 7 8 6 8 1 3 Kt qa 6
Gii thch: khu t chn c c ta (1,2), (2,4). Added by: Date: Time limit: Source limit: Languages: Ng Minh c 2007-12-19 2s 50000B C C++ PAS gpc PAS fpc JAVA TEXT
18 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Resource:
Khc Anh Tun - ICAMP 4
19 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2243. Mng my tnh

Problem code: NKONEARC
VOI library Mt h thng n my tnh (cc my tnh c nh s t 1 n n) c ni li thnh mt mng bi m knh ni, mi knh ni hai my no v cho php ta truyn tin mt chiu t my ny n my kia. Gi s s v t l 2 my tnh trong mng. Ta gi ng truyn t my s n my t l mt dy cc my tnh v cc knh ni chng c dng: s = u1, e1, u2, ..., ui, ei, ui+1, ..., uk-1, ek-1, uk = t trong u1, u2, ..., uk l cc my tnh trong mng, ei - knh truyn tin t my ui n my ui+1. (i = 1, 2,... , k-1). Mng my tnh c gi l thng sut nu nh i vi hai my u, v bt k ta lun c ng truyn tin t u n v v ng truyn tin t v n u. Mng my tnh c gi l hu nh thng sut nu i vi hai my u, v bt k, hoc l c ng truyn t u n v, hoc l c ng truyn t v n u. Bit rng mng my tnh cho l hu nh thng sut nhng khng thng sut. Yu cu: hy xc nh xem c th b sung ng mt knh truyn tin bin mng cho tr thnh thng sut c khng?
D liu
Dng u tin ghi 2 s nguyn n v m. Dng th i trong s m dng tip theo m t knh ni th i bao gm 2 s nguyn dng ui v vi cho bit knh ni th i cho php truyn tin t my ui n my vi, i=1,2,...,m. Cc s trn cng mt dng c ghi cch nhau bi du cch.
Kt qa
Dng u tin ghi 'YES' nu cu tr li l khng nh, ghi 'NO' nu cu tr li l ph nh. Nu cu tr li l khng nh th dng th hai ghi hai s nguyn dng u, v cch nhau bi du cch cho bit cn b sung knh truyn tin t my u n my v bin mng thnh thng sut.
Hn ch
Trong tt c cc test, n 2000, m 30000.
V d
D liu: 3 2 1 2 2 3 Kt qa
20 of 90
4/5/2008 10:00 PM
SPOJ Booklet
YES 3 1
21 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2245. Vng ua F1
Problem code: NKRACING
Singapore s t chc mt cuc ua xe Cng Thc 1 vo nm 2008. Trc khi cuc ua din ra, xut hin mt s cuc ua v m tri lut. Chnh quyn mun thit k mt h thng kim sot giao thng bt gi cc tay ua phm lut. H thng bao gm mt s camera t trn cc tuyn ng khc nhau. m bo tnh hiu qu cho h thng, cn c t nht mt camera dc theo mi vng ua.
H thng ng Singapore c th c m t bi mt dy cc nt giao thng v cc ng ni hai chiu (xem hnh v). Mt vng ua bao gm mt nt giao thng xut pht, tip theo l ng i bao gm t nht 3 tuyn ng v cui cng quay tr li im xut pht. Trong mt vng ua, mi tuyn ng ch c i qua ng mt ln, theo ng mt hng. Chi ph t camera ph thuc vo tuyn ng c chn. Cc s nh trong hnh v cho bit chi ph t camera ln cc tuyn ng. Cc s ln xc nh cc nt giao thng. Camera c t trn cc tuyn ng ch khng phi ti cc nt giao thng. Bn cn chn mt s tuyn ng sao cho chi ph lp t l thp nht ng thi vn m bo c t nht mt camera dc theo mi vng ua. Vit chng trnh tm cch t cc camera theo di giao thng sao cho tng chi ph lp t l thp nht.
22 of 90
4/5/2008 10:00 PM
SPOJ Booklet
D liu
Dng u tin cha 2 s nguyn n, m ( 1 n 10000, 1 m 100000) l s nt giao thng v s ng ni. Cc nt giao thng c nh s t 1 n n. m dng tip theo m t cc ng ni, mi dng bao gm 3 s nguyn dng cho bit hai u mt ca tuyn ng v chi ph lp t camera. Chi ph lp t thuc phm vi [1, 1000].
Kt qa
In ra 1 s nguyn duy nht l tng chi ph lp t tht nht tm c.
V d
D liu: 6 7 1 2 5 2 3 3 1 4 5 4 5 4 5 6 4 6 3 3 5 2 3 Kt qa 6
Ng Minh c 2007-12-23 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT ACM Singapore Regional 2007
23 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2248. Truyn tin

Problem code: NKMSG
Mt lp gm n hc sinh, mi hc sinh c th lin lc vi mt s hc sinh khc. Mt hc sinh a c th lin lc vi hc sinh b, nhng hc sinh b c th khng lin lc c vi hc sinh a. Thy ch nhim cn thng bo mt thng tin quan trng cho lp. Thy ch nhn tin cho mt s hc sinh, sau mi bn s nhn cho nhng bn mnh c th lin lc c. Hy gip thy gio xc nh s hc sinh t nht cn nhn sao cho c lp u nhn c tin.
D liu
Dng u tin ghi 2 s nguyn n, s hc sinh trong lp. Cc hc sinh c nh s t 1 n n. Dng th i trong n dng tip theo ghi 1 dy gm n k t 0 hoc 1. K t th j bng 1 nu v ch nu hc sinh i lin lc c vi hc sinh j.
Kt qa
In ra mt s nguyn duy nht l s hc sinh t nht thy gio cn nhn tin.
Gii hn
1 N 1500. C 50% s test c 1 N 500.
V d
D liu: 4 0100 1000 0001 0000 Kt qa 2
Ng Minh c 2007-12-27 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT SPOJVN
24 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2250. Dy con di nht

Problem code: NKMAXSEQ
VOI library Cho dy s nguyn a1, a2, , an. Dy s ai, ai+1, , aj vi 1 i j n c gi l dy con ca dy s cho v khi , j-i+1 c gi l di, cn ai+ai+1...+aj c gi l trng lng ca dy con ny. Yu cu: cho s nguyn p, trong s cc dy con ca dy s cho c trng lng khng nh hn p hy tm dy con c di ln nht.
D liu vo
Dng u tin ghi hai s nguyn n v p cch nhau bi du cch. Dng th i trong s n dng tip theo cha s nguyn ai l s hng th i ca dy s cho, i = 1, 2, , n.
Kt qa
Ghi ra s nguyn k l di ca dy con tm c (qui c: nu khng c dy con no tha mn iu kin t ra th k = -1).
Hn ch
Trong tt c cc test: 1 n 50000; |ai| 20000; |p| 109. C 50% s lng test vi n 2000.
V d
D liu mu 5 6 -2 3 2 -2 3 Kt qa 4 D liu mu 4 9 2 3 2 -2 Kt qa -1
Added by: Date:

25 of 90
Ng Minh c 2007-12-27
4/5/2008 10:00 PM
SPOJ Booklet
Time limit: Source limit: Languages: Resource:
1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT thi quc gia 2006
26 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2251. ng i trn li
Problem code: NKPATH
VOI library Cho mt li vung gm m dng v n ct. Cc dng c nh s t 1 n m t trn xung di, cc ct c nh s t 1 n n t tri qua phi. nm v tr dng i v ct j ca li c gi l (i, j) v khi , i c gi l ta dng cn j c gi l ta ct ca ny. Trn (i, j) ca li ghi s nguyn dng aij, i = 1, 2, , m; j = 1, 2, , n. Trn li cho, t (i, j) ta c th di chuyn n (p, q) nu cc iu kin sau y c tha mn: j < n; i p; j q v i + j < p + q; aij v apq c c s chung ln hn 1. Ta gi mt cch di chuyn t mp tri sang mp phi ca li l cch di chuyn bt u t mt c ta ct bng 1 qua cc ca li theo qui tc di chuyn nu v kt thc mt c ta ct bng n. Yu cu: Tnh s cch di chuyn t mp tri li sang mp phi li.
D liu vo
Dng u tin ghi 2 s nguyn dng m, n. Dng th i trong s m dng tip theo ghi n s nguyn dng ai1, ai2, , ain l cc s trn dng th i ca li, i = 1, 2, , m. Hai s lin tip trn cng mt dng c ghi cch bi t nht mt du cch.
Kt qa
Ghi ra 1 s nguyn l phn d ca s lng cch di chuyn tm c cho 109.
Hn ch
Trong tt c cc test: 1 < m, n 100; aij 30000, i=1,2,,m;j=1,2,,n. C 50% s lng test vi m, n 50.
V d
D liu mu 2 2 2 4 6 8 Kt qa 4 D liu mu 2 2 2 5 6 7 Kt qa
27 of 90
4/5/2008 10:00 PM
SPOJ Booklet
28 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2253. A1
Problem code: NKA1
Tho lun
Chnh ph lp ra mt hi ng sa cha ng cao tc chnh A1 ca t nc. ng cao tc c dng mt ng thng, bao gm cc ct cy s lin tip cch u nhau. Hai ct cy s lin tip cch nhau 1km. Ct cy s th nht cch im u tin ca ng cao tc 1km. C N v tr ct cy s cn sa cha trn ng cao tc. Mi ct cy s c xc nh bi mt s nguyn cho bit khong cch i vi im u tin ca ng cao tc (tnh theo km). Bt u t mt ct cy s no , ng cao tc c chia thnh cc on di bng nhau, mi on cha ng M ct cy s lin tip. Mt i sa ng s c gi n mi on c cha mt (hoc nhiu) v tr cn sa cha. Thng thng, s v tr cn sa cha ln hn nhiu so vi s i sa ng nn tt nht cn chia ng cao tc thnh cc on di bng nhau sao cho s on cha v tr cn sa cha l t nht. Bit rng trong M ct cy s u tin, khng c v tr no cn sa cha. on u tin phi c bt u trong M ct cy s u tin. Hi cn huy ng t nht bao nhiu i sa ng sa cha c tt c v tr cn thit trn ng cao tc A1? Xc nh cc v tr m on u tin c th bt u.
D liu
Dng u tin bao gm 2 s nguyn M v N cch nhau bi khong trng (1 M, N 100000). Dng th 2 bao gm N s nguyn cch nhau bi khong trng m t nhng v tr cn sa cha. N s nguyn to thnh mt dy tng cht, mi s khng vt qu 2000000000.
Kt qa
Dng u tin cha s i sa ng t nht cn huy ng. Dng th hai cha tt c cc v tr m on u tin c th bt u. Cc s cch nhau bi khong trng v phi to thnh mt dy tng cht.
V d
D liu: 3 5 4 5 7 8 9 Kt qa 2 1 D liu: 4 3 7 14 15 Kt qa 2 1 2 4 D liu:
29 of 90
4/5/2008 10:00 PM
SPOJ Booklet
2 10 3 4 7 8 12 13 14 15 20 21 Kt qa 7 1 2
Ng Minh c 2007-12-27 5s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Croatian OI 2003
30 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2259. Chia a gic

Problem code: NKPOLY
c vua vng quc XYZ t chc kn r cho c cng cha duy nht ca mnh. V vy, ng t ra nhng yu cu rt cao cho con r tng lai. c th tr thnh con r ca ngi, cc chng trai thi nhau th hin mnh. Sau khi vt qua nhng phn thi i hi sc kho, lng dng cm, h s gp phi mt th thch v cng kh khn, l phn thi v s nhanh nhy v thng minh. c vua s cho mi ngi mt ming ba hnh a gic li N nh. c vua yu cu cc chng trai v N-3 ng cho bt k sao cho 2 ng cho bt k khng c im chung khc cc u mt. Vi cch v nh vy, chng ta s thu c N-2 hnh tam gic. c vua yu cu h hy tm 2 cch chia: Mt cch chia sao cho tam gic c din tch ln nht trong N-2 tam gic l ln nht. Mt cch chia sao cho tam gic c din tch ln nht trong N-2 tam gic l nh nht. Sau khi nh vua a ra hnh dng ca a gic li, h s ch c 1 giy a ra p n ca mnh. Ngi a ra p n ng nht v nhanh nht s c chn lm ph m. Bn cng l mt ngi lt vo vng thi ny. Hy chng t kh nng ca mnh i!
D liu
Dng u tin ghi s nguyn N l s nh ca a gic. Trong n dng sau, mi dng ghi mt cp s nguyn l ta cc nh ca a gic. Cc nh c lit k theo chiu kim ng h.
Kt qa
Dng th nht ghi din tch ca tam gic ln nht trong trng hp 1. Dng th hai ghi din tch ca tam gic ln nht trong trng hp 2. Cc gi tr din tch c chnh xc 1 ch s thp phn.
Gii hn
4 N 200. Cc ta l cc s nguyn c tr tuyt i khng qu 106.
V d
D liu: 5 0 0 0 2 1 4 2 2 2 0 Kt qa 4.0 2.0
Added by:
31 of 90
Ng Minh c
4/5/2008 10:00 PM
SPOJ Booklet
Date: Time limit: Source limit: Languages: Resource:
2007-12-31 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT IOICamp Marathon 2005-2006
32 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2262. Tung ng xu
Problem code: NKTOSS
Ngy xa, cch y lu lm ri, vng quc Byteland ti p c mt nng cng cha xinh p tuyt trn. Tht khng may, chnh v s xinh p lm ph thy Astral bt lm v lm ngi hu cho ng ta. c Vua v cng hoang mang khi chuyn ny xy ra, ng khng bit phi lm cch no gii cu con mnh (ng khng th mang qun n nh v iu l v ngha). Tuy nhin, tn ph thy ny li rt s mt cu thn ch c suy ra t vic gii mt bi ton c ca Thn Sphinx. Bi ton c th c m t mt cch n gin nh sau: Khi ta tung mt ng xu, ta s nhn c mt sp hoc nga. Nu ta tung ln lt N ng xu th c bao nhiu trng hp m c t nht K ng xu lin tip cng l nga ? . c vua ha s thng rt hu hnh v g cng cha cho ai gii c bi ton ny. Thc ra cng cha v anh chng lm vn trong hong cung yu thng nhau t lu. Anh chng gi y ang rt bi ri v cn s gip ca bn.
D liu
Mt dng duy nht ghi hai s N v K.
Kt qa
Mt dng duy nht ghi s trng hp m c.
Gii hn
1 K N 10000
V d
D liu: 4 2 Kt qa 8 D liu: 4 3 Kt qa 3
Ng Minh c 2008-01-02 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT IOICamp Marathon 2005-2006
33 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2263. Dy nghch th
Problem code: NKINV
Cho mt dy s a1.. aN. Mt nghch th l mt cp s u, v sao cho u < v v au > av. Nhim v ca bn l m s nghch th.
D liu
Dng u ghi s nguyn dng N. N dng sau mi dng ghi mt s ai ( 1 i N ).
Kt qa
Ghi trn mt dng s M duy nht l s nghch th.
Gii hn
1 N 60000 1 ai 60000
V d
D liu: 3 3 1 2 Kt qa 2
Ng Minh c 2008-01-02 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT IOICamp Marathon 2005-2006
34 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2267. Hon v di nht

Problem code: NKLP
Cho dy A gm N phn t A1, A2, ..., AN l cc s nguyn. Mt dy con ca dy A l dy gm cc phn t lin tip AU, AU+1, ..., AV trong 1 U V N. Mt dy con B c di K ca A c coi l ng quan tm nu dy B l mt hon v ca K s 1, 2, ..., K. Nhim v ca bn l tm mt dy con ng quan tm di nht ca A.
D liu
Dng th nht ghi s N l s phn t ca dy A. Dng th hai ghi N s A1, A2, ..., AN.
Kt qa
Mt s duy nht l di ln nht tm c.
Gii hn
1 N 100 000. 1 AU N.
V d
D liu: 5 4 1 2 1 3 Kt qa 3
Ng Minh c 2008-01-02 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT IOIcamp Marathon 2005-2006
35 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2292. Tr chi d mn
Problem code: NKMINES
Mt bi mn hnh ch nht c cnh M N nguyn dng. Bi mn c chia thnh M N vung n v bng cc ng song song vi cc cnh, cc dng vung nh s t 1 n M t trn xung di, cc ct vung nh s t 1 n N t tri sang phi, hai vung khc nhau c gi l k nhau nu chng c t nht mt nh chung. Mi vung c khng qu mt qu mn. ghi nhn tnh trng mn ti cc ng thi c th gi b mt phn no, ngi ta lp mt mng hai chiu M dng N ct m A[U, V] bng s mn c im chung vi [U, V] ca bi mn (c nhiu nht 8 c im chung vi mt cho trc). Cho mng A, hy tm cch xc nh cc c mn.
D liu
Dng u gm hai s nguyn M, N l kch thc hnh ch nht. M dng sau, mi dng ghi N s th hin mng A.
Kt qa
Gm M dng, mi dng ghi N s 0 hoc 1 tng ng vi khng c mn hoc c mn. Nu c nhiu kt qu tha mn, ch cn a ra mt kt qu duy nht. Bit rng d liu vo lun m bo c t nht mt kt qu.
Gii hn
1 M, N 200
V d
D liu: 4 4 1 3 3 1 2 3 4 4 3 6 5 3 1 3 3 3 Kt 1 0 0 1 0 0 1 1 qa 0 1 1 0 1 1 1 0
Ng Minh c 2008-01-04 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT IOIcamp Marathon 2005-2006
36 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2305. H thng n
Problem code: NKLIGHT
Khu vc t cc b xng c dng mt hnh ch nht m x n vung. Cc hng c nh s t 1 n m t trn xung di, cc ct c nh s t 1 n n t tri sang phi. Ti k ca li c t cc b xng. Ngi ta cn xy dng mt h thng n pha chiu sng, mi n ch chiu dc theo hoc l hng hoc l ct ca li vung sao cho mi b cha phi c chiu sng bi t nht mt n pha. Bit: ai l chi ph xy dng n chiu sng dc theo hng i. bj l chi ph xy dng n chiu sng dc theo ct j. Yu cu: Tm cch xy dng h thng n vi tng chi ph b nht.
D liu
Dng u tin cha 3 s nguyn dng m, n, k. Dng th hai cha m s a1, a2 ... , am. Dng th ba cha n s b1, b2 ... , bn. Dng th i trong s k dng tip theo cha ta ca b xng th i.
Kt qa
Dng u ghi tng chi ph theo cch xy dng tm c. Dng th hai ghi P v Q theo th t l s lng n chiu dc theo hng v ct (ghi s 0 nu khng c). P+Q dng tip theo cha ln lt cc ta ca cc hng, ri n ta ca cc ct c t n chiu sng, mi ta ghi trn mt dng.
Gii hn
1 m , n 100. k mn. 1 ai 100. 1 bi 100.
V d
D liu: 2 3 4 10 5 12 4 2 1 2 1 3 2 1 2 3 Kt qa
37 of 90
4/5/2008 10:00 PM
SPOJ Booklet
11 1 2 2 2 3 D liu: 2 3 4 15 17 2 4 6 1 1 2 2 2 3 2 1 Kt qa 12 0 3 1 2 3
38 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2307. Trang tr dn n
Problem code: NKDEC
Nhn dp Ging sinh v nm mi, mt ca hng lp t mt dn n c dng bng hnh ch nht m x n. Trn dn n c mt s v tr cn lp t bng n. Ca hng mun trang tr dn n bng cc bng n mu. tht p mt, ca hng mun cc bng n nm trn cng hng hoc cng ct u khc mu nhau! Nhng m bo s hi ha, dn n khng nn c qu nhiu mu. Bn hy gip ca hng trang tr dn n, sao cho s loi bng n mu cn s dng l t nht!
D liu
Dng u tin cha 2 s nguyn m, n (1 m, n 100) m dng tip theo, mi dng cha n k t '0' hoc '1' th hin dn n, k t '1' cho bit v tr cn lp t bng n.
Kt qa
Dng u tin: cha s nguyn p l s loi bng n mu t nht cn s dng. Dng th i trong s m dng tip theo cha n s nguyn, s th j l ch s mu ca bng n v tr tng ng, hoc l 0 nu v tr tng ng khng cn lp t bng n. Cc mu c nh s t 1 n p.
V d
D liu: 5 10 1100111010 0011000101 0001011000 0110001010 1111010100 Kt 6 3 2 0 0 0 0 0 3 2 4 qa 0 2 0 1 3 0 3 2 0 5 4 0 0 0 0 5 0 3 0 6 6 0 1 4 0 0 4 0 0 1 1 0 0 2 0 0 1 0 0 0
39 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2336. Ma thin thch

Problem code: NKRAIN
Ph ng nhn c thng tin v mt cn ma thin thch sp p xung tri t. Ph ng nh Cui xc nh xem c bao nhiu thin thch c th ri xung cnh ng ca ng ta. Cnh ng ca Ph ng c dng mt hnh a gic li c xc nh bi danh sch cc nh c lit k theo chiu ngc kim ng h. Yu cu: Xc nh xem trong tp cho trc cc im ri ca thin thch c bao nhiu im nm trn cnh ng ca ph ng. Cc im nm trn bin ca cnh ng khng c tnh l im nm trn cnh ng.
D liu
Dng u tin cha s nguyn n (3 n 5000) l s nh ca a gic li m t cnh ng ca Ph ng. Mi dng trong s n dng tip theo cha cp ta ca mt nh ca a gic li, hai s c ghi cch nhau bi du cch. Dng tip theo l s nguyn m (2 m 5000) - s im ri ca thin thch. Mi dng trong s m dng cui cng cha hai s c phn cch nhau bi du cch l ta im ri ca mt thin thch. Cc ta ri l cc s nguyn c gi tr tuyt i khng vt qa 106.
Kt qa
Ghi ra m dng, mi dng tng ng vi mt im ri ca thin thch. Ghi 'YES' nu im ri ca thin thch nm trong cnh ng v ghi 'NO' nu tri li.
V d
D liu: 4 2 4 8 4 6 8 4 6 4 3 5 4 7 5 5 6 7 Kt qa NO NO YES YES
Added by: Date: Time limit:
Ng Minh c 2008-01-14 1s
40 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Source limit: Languages:
50000B C C++ PAS gpc PAS fpc JAVA TEXT
41 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2341. Dy Catalan
Problem code: NKCAT
Dy Catalan bc n l dy gm 2n+1 s nguyn C0, C1 C2n tha mn cc iu kin: C0=C2n=0 |Ci+1-Ci|=1 vi mi 0 i < 2n V d: 0 1 2 1 0 1 0 l mt dy Catalan bc 3. Cho trc gi tr n, ta sp xp cc dy Catalan bc n theo th t t in, nh s bt u t 1. V d vi n=3, cc dy Catalan c sp xp theo th t nh sau:
0 0 0 0 0 1 1 1 1 1 0 0 2 2 2 1 1 1 1 3 0 2 0 2 2 1 1 1 1 1 0 0 0 0 0
Bn cn vit chng trnh x l hai loi yu cu: 1. Cho mt dy Catalan, hy tm s th t t in ca dy . 2. Cho mt s th t t in, hy tm dy Catalan c th t .
D liu
Dng u ghi s nguyn n (1 n 15). Dng th hai ghi mt dy s Catalan bc n. Dng th ba ghi mt s nguyn dng k (d liu lun m bo tm c dy Catalan bc n c th t t in bng k).
Kt qu
Dng u tin ghi s th t ca dy Catalan tng ng vi yu cu 1. Dng th hai ghi 2n+1 s cch nhau bi khong trng, l dy Catalan tng ng vi yu cu 2.
V d
D liu: 4 0 1 2 3 2 1 2 1 0 1 Kt qa 12 0 1 0 1 0 1 0 1 0
42 of 90
4/5/2008 10:00 PM
SPOJ Booklet
43 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2342. Chui ht
Problem code: NKNLACE
Khi tin hnh khai qut kho c mt vng quc xa xa n, cc nh khoa hc khai qut c rt nhiu chui ht l. Sau khi quan st, cc nh khoa hc thy rng cc chui ht c mt s c im chung. Mi chui ht l mt si dy c nh cc ht ngc lm bng mt cht liu c xa. Cc chui ht u c s lng ht ngc bng nhau. Hn na, mi ht ngc l mt hnh cu c ng knh l mt s nguyn dng, v nu ln t tri sang phi trn chui ht, ngi ta thy cc ht ngc c ng knh tng dn. Nu nh s v tr cc ht ngc bt u t 1, theo th t t tri sang phi, ngi ta nhn thy rng ht ngc th i c ng knh khng vt qa 2i. Cc nh khoa hc cho rng, dn tc c xa ny hn lm ra tt c cc chui ht c cng nhng c im ny, d chng hin cn ang ri rc u trn tri t. Sau khng lu, cc nh khoa hc tm ra mt mnh da, trn c ghi mt con s theo loi ch s c xa. H cho rng mnh da ny c lin quan n cc chui ht k l n. Sau nhiu c gng, cc nh khoa hc a c con s trn mnh da v h ch s thp phn, v k hiu l X. Manh mi n y th dng li, v cc nh khoa hc khng tm thy c vt tch no khc na, v cng khng tm ra c mi quan h gia X v cc chui ht. n y, mt nh khoa hc ngi Vit ngh, hy th xc nh chui ht c th t t in l X, bit u y s l manh mi?
Yu cu
Bn hy vit chng trnh gip nh khoa hc xc nh chui ht c th t t in l X.
D liu
Dng 1: cha s nguyn dng N, l s ht ngc trong mi chui ht. Dng 2: cha s nguyn dng X.
Kt qa
Gm 1 dng duy nht, cha N s nguyn, cch nhau mt khong trng, xc nh chui ht c th t t in l X ( biu din mt chui ht, cn in ra N s nguyn tng ng l ng knh ca cc ht ngc trong chui ht, theo th t t tri sang phi).
Gii hn
N l s nguyn dng trong phm vi [1, 250]. X l s nguyn dng trong phm vi t 1 n s lng ti a cc chui ht.
V d
D liu 2 4 Kt qa
44 of 90
4/5/2008 10:00 PM
SPOJ Booklet
2 3
Gii thch: cc chui ht sp theo th t t in ln lt l 1 2, 1 3, 1 4, 2 3, 2 4. Chui ht th 4 l 2 3. Added by: Date: Time limit: Source limit: Languages: Resource: Ng Minh c 2008-01-14 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Ng Minh c
45 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2343. Dy ngoc bc K
Problem code: NKBRK2
Dy ngoc v bc ca dy ngoc c nh ngha quy nh sau: Dy ngoc bc 0 l chui rng. Nu S l dy ngoc bc K th (S) l mt dy ngoc bc k+1. Nu A, B l cc dy ngoc th S=AB l mt dy ngoc v DS=max(DA, DB) (k hiu bc ca dy ngoc X l DX). Cho 2 s nguyn dng N v K, gi S l tp cc dy ngoc bc K c di N k t. Hy vit chng trnh x l cc yu cu sau: 1. Cho bit S c bao nhiu phn t. 2. Cho mt dy ngoc bc K c di N k t, hy cho bit th t t in ca dy ny trong tp S.
D liu
Dng u tin cha 2 s N, K (N l s chn khng vt qu 60, K N/2). Dng th hai cha mt dy ngoc bc K c di N k t.
Kt qa
Dng th nht ghi s phn t ca tp S. Dng th hai ghi th t t in ca dy ngoc cho trong tp S.
V d
D liu 6 2 (())() Kt qa 3 2
46 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2348. Mng truyn tin

Problem code: NKNET
Trong mt chin dch, ngi ta thu thp c thng tin v mt mng truyn tin ca i phng, bao gm n trm v m ng ni gia nhng trm ny. Cc trm c nh s t 1 n n. Hai trm lin lc c vi nhau nu c mt ng ni trc tip gia chng hoc c mt dy nhng ng ni i qua mt s trm trung gian no y. Yu cu t ra l tm cch ph hy mt s ng ni hai trm cho trc khng lin lc c vi nhau. Gi thit ban ch huy nhn lc c mi i ph trch vic ph hu mt ng ni v lnh ph hu c pht ng thi. Do a hnh khc nhau nn vic ph hu mi ng ni cn mt khong thi gian tng ng khc nhau. Hy tm mt phng n thi im hon thnh nhim v l sm nht. Nu c nhiu phng n nh th, hy tm phng n phi c t i nht.
D liu
Dng u ghi gi tr n l s trm ca mng (khng qu 100). Dng tip ghi gi tr m l s ng ni ca mng (khng qu n(n-1)/2). m dng tip theo, mi dng ghi thng tin ca mt ng ni gm 3 gi tr nguyn dng: hai gi tr u l s hiu ca ha trm xc nh ng ni, gi tr sau (khng qu 100) l thi gian cn thit cho vic ph hy ng ni ny. Dng cui cng ghi hai gi tr l s hiu ca hai trm cn ct t lin lc.
Kt qu
Dng u ghi gi tr m l s ng ni cn ph hy. m dng tip theo, mi dng m t mt ng ni cn ph hy gm hai gi tr l s hiu ca hai trm xc nh ng ni ny. Cc gi tr s ghi trn cng mt dng cch nhau t nht mt du trng. D liu vo lun m bo c ng truyn tin ni hai trm cn ct lin lc.
V d
D liu: 5 6 1 2 3 1 5 1 2 3 1 2 5 1 3 4 4 3 5 3 1 4 Kt qa 3 1 5 2 3 2 5
Gii thch: thi gian hon thnh nhim v l 1.
47 of 90
4/5/2008 10:00 PM
SPOJ Booklet
48 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2367. Gii bng

Problem code: NKLEAGUE
Mt gii thi u bng gm n i thi u vng trn mt lt. Cc i bng c nh s th t t 1 n n. Theo th l gii u, nu trn u din ra vi kt qu ha, hai i s thi u lun lu cho n khi phn nh thng thua (ngha l cc trn u u c phn nh thng thua). Hi c tn ti mt cch sp xp cc i theo th t sao cho trong th t , mi i u thng trn u vi i lin sau mnh? Trong trng hp tn ti, hy xc nh mt cch sp xp nh vy.
D liu
Dng u tin cha s nguyn n, s i bng tham d gii u. (1 n 1000). Dng th i trong s n dng tip theo cha j k t 0 hoc 1, k t th j th hin gi tr aij : aii = 0 vi mi i. aij = 1 nu v ch nu i i thng i j. D liu vo lun tha mn aij+aji = 1 vi i khc j.
Kt qu
In ra -1 nu khng tn ti cch sp xp tha mn yu cu. Trong trng hp tn ti, in ra n s nguyn l ch s ca cc i bng trong cch sp xp tm c.
Hn ch
C 30% s test c n 9.
V d
D liu
3 010 000 110 3 1 2
Kt qu
Ng Minh c 2008-01-19 1s 50000B C C++ PAS gpc PAS fpc JAVA Ng Minh c / vCoder08
49 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2368. Lp lch trn hai my

Problem code: NK2MFS
C N chi tit my cn c gia cng ln lt trn hai my A v B. Thi gian gia cng chi tit i trn my A l ai, thi gian gia cng trn my B l bi. Yu cu: hy tm trnh t gia cng cc chi tit trn hai my sao cho vic hon thnh gia cng tt c cc chi tit l sm nht c th.
D liu
Dng u tin cha s nguyn dng N (1 N 10000). Dng th hai cha N s nguyn dng a1, a2 an (1 ai 10000) Dng th ba cha N s nguyn dng b1, b2, bn (1 bi 10000).
Kt qu
Dng u tin cha s nguyn dng T l thi im sm nht c th hon thnh. Dng tha hai cha N s nguyn cho bit lch trnh gia cng cc chi tit my.
V d
D liu: 3 2 3 1 1 2 3 Kt qa 7 3 2 1
50 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2377. n trng
Problem code: LQDBUS
Trng THPT chuyn L Qu n, TP Nng c mt h thng xe but ring. Hng ngy xe but s chy dc theo b sng Hn th mng n cc hc sinh n trng. Trn hnh trnh, xe but s tip nhn cc hc sinh ng ch cc in hn nu nh xe cn ch trng. Xe but c th li ch nhng hc sinh cha kp n im hn. Tuy nhin v hc sinh trng L Qu n l nhng hc sinh rt coi trng vic gi gic nn h c th xe but ch ch khng bao gi chu ch xe but. iu c ngha l nu h n im hn m xe cha n th h s t i b n trng. Cho bit thi im m mi hc sinh n im hn ca mnh v thi im qua mi im hn ca xe but. Gi thit rng xe but n im hn u tin ti thi im 0 v thi gian xp khch ln xe c bng 0. Xe but cn phi ch mt s lng nhiu nht cc hc sinh c th c n trng. Hy xc nh khong thi gian ngn nht xe but thc hin cng vic.
D liu vo
Dng u tin cha 2 s nguyn dng n, m theo th t l s im hn v s ch ngi ca xe but. Dng th i trong s n dng tip theo cha s nguyn ti l thi gian cn thit xe but di chuyn t im hn th i n im hn th i+1 (im hn th n+1 s l trng L Qu n) v s nguyn k l s lng hc sinh n im hn i, tip theo k s nguyn l cc thi im n im hn ca k hc sinh.
Kt qa
Gm mt dng duy nht, l thi gian ngn nht tm c.
Gii hn
1 n 200000, 1 m 20000 Tng s hc sinh khng vt qu 200000. Kt qu khng vt qu 231-1.
V d
D liu: 3 5 1 2 0 1 1 1 2 1 4 0 2 3 4 Kt qa 5

51 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Resource:
Bn Taek
52 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2401. VOI08 Tr chi vi dy s

Problem code: NKSGAME
VOI library Hai bn hc sinh trong lc nhn ri ngh ra tr chi sau y. Mi bn chn trc mt dy s gm n s nguyn. Gi s dy s m bn th nht chn l: b1, b2, ..., bn cn dy s m bn th hai chn l c1, c2, ..., cn Mi lt chi mi bn a ra mt s hng trong dy s ca mnh. Nu bn th nht a ra s hng bi (1 i n), cn bn th hai a ra s hng cj (1 j n) th gi ca lt chi s l |bi+cj|. V d: Gi s dy s bn th nht chn l 1, -2; cn dy s m bn th hai chn l 2, 3. Khi cc kh nng c th ca mt lt chi l (1, 2), (1, 3), (-2, 2), (-2, 3). Nh vy, gi nh nht ca mt lt chi trong s cc lt chi c th l 0 tng ng vi gi ca lt chi (-2, 2).
Yu cu
Hy xc nh gi nh nht ca mt lt chi trong s cc lt chi c th.
D liu
Dng u tin cha s nguyn dng n (n 105) Dng th hai cha dy s nguyn b1, b2, ..., bn (|bi 109, i=1, 2, ..., n) Dng th hai cha dy s nguyn c1, c2, ..., cn (|ci 109, i=1, 2, ..., n) Hai s lin tip trn mt dng c ghi cch nhau bi du cch.
Kt qu
Ghi ra gi nh nht tm c.
Rng buc
60% s tests ng vi 60% s im ca bi c 1 n 1000.
V d
D liu: 2 1 -2 2 3 Kt qa
53 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Ng Minh c 2008-01-29 1s 50000B C C++ PAS gpc PAS fpc JAVA VOI 2008
54 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2402. VOI08 L c
Problem code: NKJUMP
VOI library Nhy l c l tr chi dn gian ca Vit Nam. Ngi trn hnh tinh X cng rt thch tr chi ny v h ci bin tr chi ny nh sau: Trn mt phng v n vng trn c nh s t 1 n n. Ti vng trn i ngi ta in s nguyn dng ai. Hai s trn hai vng trn ty khng nht thit phi khc nhau. Tip n ngi ta v cc mi tn, mi mi tn hng t mt vng trn n mt vng trn khc. Quy tc v mi tn l: Nu c ba s ai, aj, ak tha mn ak = ai + aj th v mi tn hng t vng trn i n vng trn k v mi tn hng t vng trn j n vng trn k. Ngi chi ch c di chuyn t mt vng trn n mt vng trn khc nu c mi tn xut pht t mt trong s cc vng trn, di chyn theo cch mi tn v i n cc vng trn khc. Ngi thng cuc s l ngi tm c cch di chuyn qua nhiu vng trn nht. V d: Vi 5 vng trn v cc s trong vng trn l 1, 2, 8, 3, 5, tr chi c trnh by trong hnh di y:
Khi c th di chuyn c nhiu nht qua 4 vng trn (tng ng vi ng di chuyn c t m trn hnh v).
Yu cu
Hy xc nh xem trong tr chi m t trn, nhiu nht c th di chuyn c qua bao nhiu vng trn.
D liu
Dng u cha s nguyn n (3 n 1000); Dng th hai cha dy s nguyn dng a1, a2, ..., an (ai 109, i=1, 2,..., n). Hai s lin tip trn mt dng c ghi cch nhau bi du cch.
Kt qu
Ghi ra s lng vng trn trn ng di chuyn tm c.
Rng buc
60% s tests ng vi 60% s im ca bi c 3 n 100.
55 of 90
4/5/2008 10:00 PM
SPOJ Booklet
V d
D liu: 5 1 2 8 3 5 Kt qa 4
Ng Minh c 2008-01-29 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT VOI 2008
56 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2403. VOI08 Qu tt
Problem code: NKGIFTS
VOI library ChuNn b n nm mi. Cng ty bnh ko Hng Da lm mt tm scla cc ln vi mc ch ghi tn mnh vo sch k lc Ghi-nt ng thi qung b thng hiu trc cng chng. Tm scla c hnh vung kch thc 2kx2k, to thnh li vung 2k hng v 2k ct. Cc hng c nh s t 0 n 2k-1 t trn xung di, cc ct c nh s t 0 n 2k-1 t tri sang phi. nm hng i v ct j c gi l (i, j). Sau bui trng by gii thiu sn phNm, tm scla c ct nh, chia cho mi ngi, mi ngi c mt ca chic bnh k lc. B phn tip th n vo hai khc nhau (p, q) v (u, v) mi mt ng xu. V khch no may mn nhn c scla c ng xu s c tng rt nhiu sn phNm c o ca cng ty.
V chic bnh rt ln nn cng ty thit k mt my ct bnh. My thc hin dy cc thao tc ct, bt u t chng bnh ch gm 1 tm scla ban u, mi thao tc gm hai bc sau: Bc 1: Ct ngang song song vi cnh chng bnh chia chng scla thnh hai phn bng nhau, p chng bnh bn di ln chng bnh bn trn sao cho mp di ln mp trn. Bc 2: Ct dc song song vi cnh chng bnh chia chng scla thnh hai phn bng nhau, p chng bnh bn tri ln chng bnh bn phi sao cho mp tri ln mp phi. Nh vy sau mi ln thc hin thao tc ct, chiu di v chiu rng ca cc tm scla gim i mt na. Sau k ln thc hin thao tc ct, cc ca tm scla s c xp thnh mt ct. Khch nhn bnh xp hng mt v c nh s t 1 tr i, ngi th m s nhn c ming scla th m t trn xung di. (1 m 2k x 2k). V d, vi k=1 v ng xu c n vo cc (0,0), (1,1), vic thc hin cc thao tc ct s c trnh by trn hnh v minh ha trn. Trong v d ny, v khch th nht v th ba s l nhng ngi nhn c tng phNm ca cng ty.
Yu cu
Cho bit cc s nguyn k, p, q, u, v. Hy xc nh s th t ca hai v khch may mn nhn c qu.
57 of 90
4/5/2008 10:00 PM
SPOJ Booklet
D liu
Gm mt dng cha 5 s nguyn k, p, q, u, v, cc s cch nhau bi du cch.
Kt qu
Mt dng cha hai s nguyn l s th t cc v khch may mn. Hai s phi cch nhau ng mt du cch.
Rng buc
1 k 40, 0 p, q, u, v 2k - 1. 60% s tests ng vi 60% s im ca bi c 1 k 5.
V d
D liu: 1 0 0 1 1 Kt qa 1 3
Ng Minh c 2008-01-29 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT VOI 2008
58 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2535. T chc i lp
Problem code: V8ORG
mt t nc n, lc lng an ninh va pht hin mt t chc i lp. T chc i lp ny c t chc cht ch, bao gm mng li thnh vin v ch huy cc cp bc khc nhau. Cc thnh vin ca t chc c nh s t 1 n N. T chc c mt ch huy ti cao, lun c nh s 1. Mi thnh vin ch bit vin ch huy trc tip ca mnh (c duy nht mt vin ch huy trc tip) ch khng bit cc ch huy cp cao hn. Khi tin hnh vic bt gi cc thnh vin, t chc s b phn r thnh cc nhm nh khng lin kt vi nhau, v d sau khi bt gi thnh vin s 2 (hnh 1), t chc b phn r thnh 4 nhm. Lc lng an ninh khng nh, mt nhm cha t hn K thnh vin s khng cn l mi e da cho t nc. khng lm gim hnh nh ca t nc trc d lun quc t, cc nh lnh o an ninh mun bt gi mt s lng t nht phn t i lp, sao cho cc nhm b phn r u khng cn gy nguy hi cho t nc. Cho bit cu trc ca t chc i lp, vic chng trnh gip cc nh lnh o an ninh xc nh s lng phn t i lp t nht cn bt gi.
D liu
Dng u tin cha s nguyn K (1 K 10000). Dng th hai cha s nguyn N (1 N 10000). Dng th ba cha N-1 s nguyn cch nhau bi khong trng, ch s ca ch huy trc tip ca mi phn t ca t chc (tr ch huy ti cao): s u tin cho bit ch huy ca phn t th hai, s th hai cho bit ch huy ca phn t th ba,...
Kt qa
In ra mt s nguyn duy nht l s phn t i lp t nht cn bt gi.
V d
D liu Kt qu M t
59 of 90
4/5/2008 10:00 PM
SPOJ Booklet
3 14 1 1 2 2 3 2 3 6 6 6 7 4 7
C th bt gi 4 phn t 6, 2, 7 v 8.
Hnh 1
Ng Minh c 2008-03-13 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Russian Training / vCoder08
60 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2536. Chm im
Problem code: V8SCORE
C N v gim kho trong k thi chn i tuyn tin hc. K thi bao gm K bi. V gim kho th i ngh s im ca bi j l Aij. Hi ng gim kho mun xc nh s im cho mi bi sao cho: Tng s im bng S. im ca mi bi khng b hn im ca bi trc . S im ca mi bi bng im ngh cho bi ny ca mt v gim kho no .
D liu
Dng u tin cha ba s nguyn S (1 S 200), (1 K 20), (1 N 20). Dng th i trong s N dng tip theo cha K s nguyn, s th j cho bit gi tr Aij l s im v gim kho th i ngh cho bi th j.
Kt qa
Nu tn ti mt cch cho im tha mn yu cu: Dng th nht: in ra 'YES'. Dng th hai: in ra K s nguyn l im ca mi bi tm c. Nu khng tn ti cch cho im, in ra 'NO'.
V d
D liu
100 3 2 30 20 40 50 30 50 100 2 3 1 1 2 2 3 3 YES 30 30 40
Kt qu
NO
Ng Minh c 2008-03-13 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Russian Training / vCoder.08
61 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2547. Sp xp
Problem code: V8SORT
Cho mt dy s. Bn cn sp xp dy s bng cch i ch cc cp phn t. Chi ph i ch phn t hai v tr i v v tr j l Cij. Nhim v ca bn l tm chi ph nh nht c th sp xp dy s theo th t tng dn.
D liu
Dng u tin cha dy s cn sp xp, c s phn t khng vt qu 7. Dng th i trong s N dng tip theo cha N s nguyn, s th j cho bit Cij, chi ph i ch phn t v tr th i v v tr th j. Bit N l s phn t ca dy s, cc phn t c nh s t 1 n N t tri sang phi. 0 Cij 999, Cii=0 v Cij=Cji.
Kt qa
In ra mt s nguyn dng duy nht: tng chi ph nh nht sp xp dy s theo th t tng dn.
V d
D liu
1 0 1 2 3 4 5 2 1 0 1 2 3 4 3 2 1 0 1 2 3 4 3 2 1 0 1 2 6 5 4 5 3 4 2 3 1 2 0 900 900 0 4
Kt qu
Ng Minh c 2008-03-15 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Russian Training / vCoder.08
62 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2548. Th trng
Problem code: V8MAYORS
Mt t nc c N thnh ph, v tr ca mi thnh ph c th hin bi mt im trn mt phng ta . Tng thng va c c mun b nhim mi thnh ph mt th trng. Tng thng mun b nhim c cc th trng nam v n. Vi mi ng thng ngang hoc dc (song song vi trc ta ), gi bnh ng gii l tr tuyt i ca hiu gia s th trng nam v th trng n ca cc thnh ph nm trn ng thng . chng t tinh thn bnh ng gii ca t nc, tng thng mun b nhim cc th trng sao cho tng bnh ng gii i vi cc ng thng ngang v dc l nh nht. Bn hy vit chng trnh gip tng thng thc hin nhim v ny.
D liu
Dng u tin cha N (1 N 20000), s thnh ph ca t nc. Dng th i trong s N dng tip theo cha hai s nguyn xi, yi l ta ca thnh ph th i (xi, yi thuc phm vi s nguyn 32 bit).
Kt qu
In ra N dng, dng th i cha s nguyn 0 hoc 1 tng ng vi vic cn b nhim th trng nam hay n cho thnh ph.
V d
D liu
5 0 0 1 1 1 0 1 0 1 2 0 1 1 0 0
Kt qu
Ng Minh c 2008-03-15 1s 50000B C C++ PAS gpc PAS fpc JAVA Russian Training / vCoder.08
63 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2553. IOITRAIN - ng gp, thc mc

Problem code: IOIHELP
Cc cu hi/ kin ng gp lin quan n trang web, cc bn c th gi nh mt solution cho bi ny :) Added by: Date: Time limit: Source limit: Languages: Ng Minh c 2008-03-19 1s 50000B TEXT
64 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2554. Qun xe
Problem code: VROOKS
Tho lun
Hy tm cch t n qun xe ln mt bn c kch thc nXn (1 n 3000), sao cho tha mn cc iu kin sau: Vi mi i=1,...,n qun xe th i phi nm trong hnh ch nht xc nh bi hai cp ta : nh trn tri (ai, bi) v nh di phi (ci, di), 1 ai ci n v 1 bi di n. trn tri c ta (1, 1) v di phi c ta (n,n). Khng c hai qun xe no tn cng ln nhau, ngha l chng khng th nm trn cng hng hoc cng ct.
D liu
Dng u tin: cha s nguyn dng n 3000. Dng th i trong s n dng tip theo cha 4 s nguyn dng ai, bi, ci, di khng vt qu n cch nhau bi khong trng, cho bit phm vi hnh ch nht c th t qun xe th i.
Kt qu
Nu khng tn ti li gii cho bi ton: in ra 'NIE'. Nu tn ti li gii: in ra n dng, dng th i cha ta ca qun xe th i (dng, ct). Ta phi thuc phm vi hnh ch nht tng ng ca qun xe ny.
V d
D liu 4 1 1 1 1 1 3 2 4 3 1 4 2 2 2 4 4 Kt qu 1 1 2 3 3 2 4 4
Ng Minh c 2008-03-20 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Polish OI 3
65 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2555. Qun m
Problem code: VKNIGHTS
Tho lun
Hnh 1 m t mt qun m tn cng cc trn bn c vua. Cho mt bn c vua c kch thc 3Xn, 3 hng v n ct, trong 1 n 100, v mt tp gm Z . Cc dng c nh s 1 n 3 t trn xung di, cc ct c nh s 1 n n t tri sang phi. Cc qun m khng c t trn cc thuc tp Z. Khng c hai qun m no c tn cng ln nhau. Gi s mi ct c nhiu nht mt thuc tp Z. Khi , tp Z c th m t bi dy k1, k2,... ,kn vi ki thuc {0, 1, 2, 3}. Nu ki=0, khng c no trn ct i thuc tp Z, trong cc trng hp cn li, ki l ch s dng ca trn ct ny thuc tp Z.
Yu cu
Cho bit s ct n ca bn c v dy m t tp Z, hy tm s nhiu nht qun m M c th t sao cho tha mn cc iu kin nu, v L, s cch t M qun m ln bn c.
D liu
Dng u tin cha s nguyn dng n 100, l s ct trn bn c. Mi dng trong s n dng tip theo cha mt s thuc tp {0, 1, 2, 3}, l dy m t tp Z.
Kt qu
In ra hai s nguyn M v L cch nhau bi khong trng.
V d
D liu 2 1 0 Kt qu 4 2
66 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2556. Hon v cp s cng

Problem code: VPERM
Tho lun
Cho mt s nguyn n, hy tm mt hon v ca n s nguyn 0, 1, 2,..., n-1 sao cho khng c dy con gm 3 phn t no to thnh mt cp s cng. Bit dy con ca mt dy s l dy thu c bng cch xa i mt s phn t t dy ban u.
D liu
Gm mt dng duy nht cha s nguyn dng n (3 n 1000000).
Kt qu
In ra n dng, mi dng cha mt s nguyn thuc tp {0, 1, ..., n-1} th hin mt hon v tha mn iu kin nu.
V d
D liu 5 Kt qu 3 1 0 4 2
67 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2557. Tng ng ha hai t

Problem code: VWORDS
Tho lun
Cho hai t x, y v mt dy hu hn cc t (w1, w2, ..., wk). Php ton p * q mang ngha l php ni t p vi t q, hay ni cch khc p * q l mt t mi to thnh bng cch vit t q pha sau t p. Ta cn kim tra xem hai t x, y c th tng ng ha bng cch s dng cc t trong dy cho trc khng. V d: T abba v ab c th tng ng ha bng cch s dng cc t trong dy: baaabad aa badccaa cc. Ta cn ni vo t abba cc t: aa v badccaa, v ni vo t ab cc t baaabad, cc v aa theo th t. Trong c hai trng hp, ta s thu c cng mt t: abbaaabadccaa.
Yu cu
Cho bit t x, t y v dy t w1, w2, ..., wk. Cho bit t x v y c th tng ng ha bng cch s dng cc t trong dy cho trc c hay khng? Nu c th, hy tm s lng nh nht php ton * cn s dng.
D liu
Dng u tin cha mt s nguyn dng k 40. Dng th hai v dng th ba m t t x v y. K dng tip theo m t dy t w1, w2, ..., wk, mi t trn mt dng. M t ca mi t cha mt s nguyn cho bit di ca t, theo sau bi khong trng v mt chui th hin t . Mi t ch bao gm cc ch ci Latin in thng v c di khng vt qu 2000. Tng di cc t khng vt qu 5000.
Kt qu
Nu khng tn ti li gii, in ra 'NIE'. Nu tn ti li gii, in ra mt s nguyn dng, l s lng nh nht cc php ton * cn tng ng ha hai t x v y.
V d
D liu 4 4 abba 2 ab 7 baaabad 2 aa 7 badccaa 2 cc Kt qu 5
68 of 90
4/5/2008 10:00 PM
SPOJ Booklet
D liu 4 1 a 2 ab 2 bb 2 ab 2 ba 2 aa Kt qu NIE
69 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2574. Mng my tnh an ton

Problem code: SAFENET2
C n my tnh nh s t 1 n n v m dy cp mng,gia 2 my tnh c th c mt hoc nhiu ng dy cp mng ni chng,khng c cp mng ni mt my vi chnh n.Hai my tnh c th truyn d liu cho nhau nu c ng cp ni trc tip gia chng hoc truyn qua mt s my trung gian. Mt tp S cc my tnh c gi l h thng an ton nu d mt my tnh bt k b tn cng (do s t m ca ngi dn :-(,c thch truy cp v hack nhng trang cm :-( ) th trong s nhng my tnh cn li,nhng my tnh thuc tp S vn c th truyn c d liu cho nhau. Xc nh s lng ln nht c th cc my tnh ca tp S
Input
-Dng 1 cha 2 s nguyn n,m(1<=n<=30.000,0<=m<=100.000) -m dng tip theo ghi thng tin v cc dy cp mng,gm 2 ch s ca 2 my c dy ni trc tip
Output
Ghi mt s nguyn duy nht l s lng my tnh ln nht tm c
Example
Input: 8 10 1 2 2 3 3 1 1 4 4 5 5 1 1 6 6 7 7 8 8 1 Output: 4
Phm Quang V 2008-03-25 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Classical Problem
70 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2578. RIVER
Problem code: LEM
Do nh v trng ca Zone nm hai bn b ca mt con sng nn hng ngy cu phi i qua sng i hc. Zone cm thy rng hnh trnh ca ng li l khng ti u v Zone mun tm ra mt ng i tt hn. Sau khi quan st v o c, Zone c th biu din c con sng bng cch ch ra 2 b ca n. Mi b sng s c biu din bng 1 ng gp khc v c xc nh bng ta ca cc im trn ng gp khc nh sau: ng gp khc biu din b pha ng ca sng c N im, im th i c ta (xi, yi). ng gp khc biu din b pha Ty ca sng c M im, im th j c ta (uj, vj). Bit rng 2 b sng khng c im chung v yi < yi+1 vi mi 1 i < N v vj < vj+1 vi mi 1 j < M. Bn hy tm 2 im A v B sao cho A nm trn b ng ca con sng v B nm trn b Ty ca con sng v khong cch AB l nh nht.
Input
- Dng u ghi 2 s nguyn dng N v M. - Dng th i trong N dng tip theo ghi 2 s nguyn xi, yi. - Dng th j trong M dng tip theo ghi 2 s nguyn uj, vj.
Output
- Gm 1 dng duy nht ghi khong cch ngn nht tm c ( Cc s thc c ghi vi chnh xc 3 ch s sau du phNy )
Example
Input: 3 4 4 0 3 2 5 4 0 0 2 2 1 3 2 5 Output: 1.000
Gii hn
2 M, N 1000
71 of 90
4/5/2008 10:00 PM
SPOJ Booklet
|xi|, |yi|, |uj|, |vj| 10000 Added by: Date: Time limit: Source limit: Languages: Resource: Sherry 2008-03-26 0.100s-0.800s 50000B C C++ PAS gpc PAS fpc JAVA TEXT IOICAMP 3
72 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2580. S ph thuc
Problem code: SUMS
Cho tp s nguyn A gm n phn t , A = {a1, a2, ..., an}, S k c gi l ph thuc vo tp A , nu k c to thnh bng cch cng cc phn t ca tp A (mi phn t c th cng nhiu ln ) .V d ,cho A = {2,5,7} .Th s cc s nh 2,4 (2+2) ,12 (5+7 hoc 2+2+2+2+2) c gi l ph thuc vo tp A ,s 0 cng gi l ph thuc vo tp A.
Yu cu
- Cho mt dy B ,hy kim tra xem bi c phi l s ph thuc vo tp A hay khng .
Input
- Dng u tin cha s nguyn n (1 n 5000). - N dng tip theo cha cc phn t ca tp A ,a1 < a2 < ... < an (1 ai 50000 ). - Dng th N+2 cha s nguyn m (1 m 10000 ). - M dng tip theo cha dy s nguyn b1, b2, ..., bm (0 bi 1000000000 ).
Output
- Gm m dng ,dng th i ghi ra TAK nu bi l s ph thuc vo tp A v NIE nu khng phi l s ph thuc.
Example
Input: 3 2 5 7 6 0 1 4 12 3 2 Output: TAK NIE TAK TAK NIE TAK
Added by: Date: Time limit:
Kaiel 2008-03-26 10s-20s
73 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Source limit: Languages: Resource:
50000B C C++ PAS gpc PAS fpc POI 2002-2003
74 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2582. Ni im
Problem code: PBCPOINT
Trn mt phng to xt cc im c to nguyn. C N im mu . bnta2 bt u tr chi nh sau: vi 2 im mu cng dng hay cng ct, ni 2 im bng 1 on thng, cc im c to nguyn nm trn on thng s c t . bnta2 c lm nh vy cho n khi khng c thm im no na. Tnh xem c bao nhiu im khi kt thc tr chi.
Input
Dng 1: cha s nguyn dng N, N<=10^5. Dng th i trong N dng tip theo: cha 2 s c gi tr tuyt i khng qu 10^3 l to ca 1 im . Hai im khc nhau th c to khc nhau.
Output
Gm 1 dng duy nht l s im cui cng.
Example
Input 4 0 2 3 1 1 4 4 4 Output 12
Bi Nguyn Tng 2008-03-26 1s-3s 50000B C C++ PAS gpc PAS fpc JAVA Su tm.
75 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2583. COIN
Problem code: LEM1
Cho N ng xu c bn knh ln lt l cc s thc dng r1.. rN. c t xung quanh mt vng trn sao cho: Mi ng xu tip xc vi 2 ng xu t cnh n v tip xc vi vng trn. Bit c bn knh ca tng ng xu. Yu cu: Tm bn knh vng trn
Input
Dng u ghi s nguyn dng N. Dng tip theo ghi N s ri ( 1 I N ).
Output
Gm 1 dng duy nht ghi bn knh hnh trn ( chnh xc n 3 ch s sau du phNy )
Example
Input: 4 2 2 2 2 Output: 0.828
Gii hn
1 N 10000 1 ri 100000 Added by: Date: Time limit: Source limit: Languages: Sherry 2008-03-26 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT
76 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2584. Tr chi di chuyn con tt

Problem code: PBCWAYS
Cho mt bng hnh ch nht c chia ra thnh NxM vung(gm N dng v M ct). Mt con tt sau mt nc i c th di chuyn t 1 ct ny sang 1 ct k tip. i vi mi vung, cho bit s hiu cc ct k tip m con tt c th di chuyn n sau 1 nc i. Con tt khng th di chuyn n n i qua trc . Thot u con tt c t mt no ca ct th nht. Sau n di chuyn v pha ct cui cng. Khi con tt n ct cui cng, ngi ta li t n vo mt no ct u tin m trc n cha h t n v tip tc di chuyn. Tr chi kt thc khi khng th thc hin nc i.
Yu cu
Xc nh xem c th thc hin nhiu nht bao nhiu ln di chuyn con tt t ct u tin n ct cui cng.
Input
Dng u tin cha 2 s nguyn dng N,M(1<=N<=50,1<=M<=10). Tip theo l M-1 nhm dng, mi nhm gm N dng, m t kh nng di chuyn ca con tt t mi ca bng. Dng th i ca nhm dng j m t kh nng di chuyn ca con tt t dng i ct j ca bng bao gm: S u tin cho bit kh nng di chuyn, tip theo l to dng ca cc trong ct k tip m con tt c th di chuyn sang(cc to c lit k theo th t tng dn).
Output
Gm 1 dng duy nht l kt qu bi ton.
Example
Input 4 3 2 1 3 3 1 2 4 0 2 2 3 1 2 1 2 1 3 2 2 4 Output 3
Ghi ch: Trong v d c th thc hin nhiu nht 3 ln con tt t ct u tin n ct cui cng. Chng hn: (1->3->3; 2->4->4; 4->2->2). Added by: Date: Bi Nguyn Tng 2008-03-27
77 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Time limit: Source limit: Languages: Resource:
1s 50000B C C++ PAS gpc PAS fpc JAVA Su tm.
78 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2586. Help Conan !

Problem code: PAIRVIS
Trong mt bui chiu p tri,Conan ang ngi code bi.Cu t nh :"Vt v c tun ri hm nay i chi mt ngy cho ". Ni l lm,cu ly $$ ri phi ra hng KFC n 2 sut combo 1 (kh tht,do ny Combo 1 ln gi,48.000 mt sut,i sang khoai ty Jumbo li cn thm 8000 na ch,chm ngi ta qu :-( ),n xong cu quyt nh ln Megastar xem phim (dn chi khng s ma ri m =)) ).Ln n ni,Conan chong vng v nhn thy cnh xp hng mua v di dng dc.Ch mi m khng n lt,Conan lin ngh ra mt bi ton rt th v cc VCoder nh sau :C N ngi xp hng mua v ng trc Conan,mi ngi c chiu cao l a_i,nhim v ca cc bn l m s cp ngi nhn thy nhau,ngi u v v nhn thy nhau khi v ch khi gia u v v khng c ai cao hn u hoc cao hn v ,vi li ha,bn no gii c s c Conan khao 1/2 gi khoai ty Jumbo (20.000 /gi y,khng r u :)) ) Ch :Bi ny O(N) l thut ton chu n,O(NLogN) hoc O(N^2) m c 100 im chng qua l may mn Accept thi
Input
-Dng u tin cha s nguyn N(1<=N<=500.000) l s ngi ng trc Conan -Mi dng trong s n dng tip theo cha chiu cao ca mt ngi(a_i<=2.10^9)
Output
Mt s nguyn duy nht l s cp ngi nhn thy nhau
Example
Input: 7 2 4 1 2 2 5 1 Output: 10
Phm Quang V 2008-03-27 0.009s-0.5s 50000B C C++ PAS gpc PAS fpc JAVA TEXT bit !
79 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2589. GUMBI
Problem code: LEM2
Mt TV c N phm bm nh s 1..N. Trc y TV cn tt, khi n 1 phm xung mi phm khc u tt v ch c phm va n l bt. By gi TV c, khi n 1 phm,ch c 1 s phm khc tt(nu n ang bt), cc phm khc khng i Mt phm d ang bt hay tt khi ta n n th phm ny s bt. Cc phm b n tc ng s tt nu ang bt. Bn c cho bit kt qu bm ca mi phm v 1 hin trng ca cc phm. Hy tm 1 dy bm lin tip 1 s t nht phm sao cho cui cng ch cn li phm K, 1 <= K <= N, l bt cc phm cn li u tt.
Input
- Gm 1 test duy nht: - Dng u l 2 s nguyn N, K - N dng tip theo, dng th i: * u tin l s S ( s phm m phm i tc ng ) . Tip theo S s l dy phm m phm i tc ng khi bt n - Dng cui l N s 0 or 1 m t hin trng bn phm ang tt or bt
Output
- Gm 1 s nguyn duy nht l s ln bm phm t nht. Nu ko c p n ghi ra -1
Example
Input: TEST 1: 3 3 2 2 3 2 1 3 2 1 2 1 1 0 TEST 2: 4 3 3 2 3 4 1 1 1 1 0 0 1 0 1 Output: TEST 1: 1 TEST 2: 2
80 of 90
4/5/2008 10:00 PM
SPOJ Booklet
Gii hn
3 N 20 Added by: Date: Time limit: Source limit: Languages: Sherry 2008-03-27 0.100s-1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT
81 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2597. Password
Problem code: PASSWORD
Cho mt xu S c di khng vt qu 2000. Tm mt xu con T (khng cn lin tip) c di chn ca xu S c di ln nht, v tha mn: T[1]=T[l] T[2]<>T[l-1] T[3]=T[l-2] ... Vi l l di ca xu T. Nu c nhiu xu cng tha mn, hy in ra xu c th t t in nh nht.
Input
Dng u tin: n, di ca xu S. Dng th hai: xu S.
Output
Gm 1 dng duy nht cha xu T
Example
Input: 6 window Output: wdow
Ng Minh c 2008-03-29 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT Thi vng 2 - 2008
82 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2600. Dy ngoc bc P
Problem code: VNBRACK
Xt nh ngha 1 dy ngoc ng: - Nu A khng c k t no th A l dy ngoc ng - Nu A l dy ngoc ng th (A) l dy ngoc ng - Nu A v B l 2 dy ngoc ng th AB l dy ngoc ng Ta gi bc ca dy ngoc ng S l hm deg(S). Gi R l dy ngoc thu c bng cch xa i N div 2 k t u v N div 2 k t cui ca S, trong 2*N l di ca S. Ta c cng thc quy tnh deg(S) nh sau: - Nu R khng phi dy ngoc ng th deg(S) = 1 - Nu R l dy ngoc ng th deg(S) = deg(R)+1 V d dy (()()) c bc l 2, dy ()(()) c bc l 1, dy (()) c bc ln v cng ( p dng v hn ln cng thc quy trn ). Yu cu: Xt cch dy ngoc c di 2*N v bc P, hy in ra dy ngoc c th t t in th K.
Input
Gm mt dng duy nht ghi ra 3 s N, P, K.
Output
Gm mt dng duy nht ghi ra dy ngoc tm c.
Example
Input: 3 1 2 Output: ()(())
Gii thch: c 3 dy ngoc di 6 v bc 1 l: (())(), ()(()), ()()(). Gii hn: - 1 <= N <= 40, 1 <= P <= 6, K nguyn dng khng vt qu 10^18 v khng vt qu s lng dy ngoc di 2*N bc P. - K t '(' c th t t in nh hn k t ')' Added by: Date: Time limit: Source limit: Languages: Resource: Problem setters of VN_SPOJ 2008-03-31 1s-2s 10000B C C++ PAS gpc PAS fpc JAVA TEXT Thi vng 2 - 2008
83 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2602. Help Conan ! (version 3)

Problem code: LSPITO
Conan gi l v i trong giang h IOITRAIN. Hn i mnh v i, Conan quyt nh ra tay gc kim, i v chi bi vi my a con nt. Nhng v tu luyn thnh cng chiu thc n Ch Thn Cng nn Conan cng khng h c i th trong tr chi bn bi. Conan thng ht tt c bi ca my a con nt cng xm. Khng ai cn bi chi tip vi Conan c. V th Conan quyt nh ngao du thin h, hy vng s tm c i th tng xng. Nhng ri cc cao th c ting nh Taek, Kaiel, Andorea... u ln lt tht bi di tay ca Conan. Qu bun, Conan ngi khc. V bt li hin ln hi: "Conan, v sao con khc? a no n mt sut KFC ca con ?". Conan thnh tht k li s tnh cho bt. Bt ni: "ng nn ch, vn cn 1 cao th Nn mnh. Con hy c tm i! Ta i y....". Nghe bt ni th Conan hm h tip tc ln ng. Trn ng i Conan gp Thu Uyn, mt c nng xinh p tuyt trn, li v cng hin du v m ang. em lng yu Thu Uyn, Conan quyn mt mc ch ca mnh, c ngy eo ui Thu Uyn. Nhng tht khng ng Conan pht hin ra Thu Uyn li chnh l cao th Nn mnh m Bt nhc n. D lng au nh ct nh Conan vn quyt nh u mt trn sinh t vi Thu Uyn. Do l mt trn u gia 2 cao th nn lut chi c thay i so vi tr bn bi thng thng: c th bn mt lc nhiu vin bi nhng khng c qu cn bc 2 ca s bi ang c. V do c 2 u rt gii nn s ko c chuyn bn bi ra ngoi l. Do th ngi thng cuc s l ngi bn vin bi cui cng. S bi ban u l k. V ang nm gi mt s b mt quan trng ca Thu Uyn nn Conan ginh quyn i trc. Th nhng Thu Uyn s chn s bi ban u. C 2 u thi u ht mnh, lun chn cch chi ti u. Conan rt mun bit trc ai s l ngi thng cuc v trn quyt u din ra trong thi gian rt lu. Bn hy gip Conan, anh ta s ni cho bn bit b mt ca Thu Uyn.
Input
Gm nhiu dng, mi dng gm 1 s k <= 10^12 l s lng bi ban u.
Output
Ghi ra ngi thng cuc tng ng vi mi s k trn 1 dng. Nu Conan thng in ra 'Conan', ngc li in ra 'Thu Uyen'.
Example
Input: 3 5 7 Output: Conan Thu Uyen Conan
My Own Way 2008-04-01 1s 50000B C C++ PAS gpc PAS fpc TEXT
84 of 90
4/5/2008 10:00 PM
SPOJ Booklet
85 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2603. Mo
Problem code: MEO
C mt vng trn n mo. Mo trng, , v xanh l cy. Khi tr chuyn vi nhau, hai mo khc mu ng thi thnh mu th ba. Mi lt, mo ng cnh nhau tr chuyn theo th t: mt v hai, hai v ba, ba v bn,... ,n v mt.
Yu cu
Cho bit mu ban u ca mo, hi mu ca mo sau k lt.
D liu
Dng 1: n, k (1 n 10000, 1 k 30000). Dng 2: dy n k t, k t th i l 'R','G', hoc 'W' cho bit mu ca mo i tng ng: , xanh hoc trng.
Kt qu
In ra dy n k t cho bit mu ca mo sau k lt.
Hn ch
C 50% s tests c 1 n 1000, 1 k 3000.
V d
D liu 3 1 GRR Kt qu RGR Gii thch: lt 1: GRR -> WWR -> WGG -> RGR. D liu 5 4 WRWRW Kt qu GGGWG
Ng Minh c 2008-04-01 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT vnoi.info
86 of 90
4/5/2008 10:00 PM
SPOJ Booklet
87 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2604. Chat chit

Problem code: CHATCHIT
Bh MN BT cHT Cht Nh 1 Ng Vt cHNh GC ri! (Joe's blog) Sau khi tri qua k thi chn i tuyn Quc t y cng thng, cc vCoders quyt nh tm gc nim am m tin hc ca mnh mt thi gian i tm nhng nim vui mi. Mt s quyt nh i Hng Kng ngh mt b li nhng ngy hc hnh vt v. S khc quay li trng hc. Nhng c bit, c mt s vCoders sau nhng bui chat m i n quyt nh: dng kin thc tin hc ca mnh gp phn gi gn s trong sng ca ting Vit. Nhm quyt nh ly tn l vitko (Viet-Coder) mi ngi thc c cng vic thm lng h ang lm. Nhn thy rng ngn ng chat ting Vit b lm dng qu nhiu, cc vitkos suy ngh v tm mt thut ton dch t ngn ng chat tr li ting Vit. D liu vo s l mt cu chat (gm cc ch ci latin in thng v khng du). Thut ton ca cc vitkos gm mt s quy tc c p dng theo th t vo cu vn. Cc quy tc ny da trn hai thao tc c bn: R(p)=q: thay tt c cc chui con p bng chui con q trong cu vn. RW(p)=q: thay tt c cc t p bng t q trong cu vn. Cc quy tc c p dng ln lt theo th t nh sau: RW('k')='khong' RW('ko')='khong' RW('ng')='nguoi' RW('n')='nhieu' RW('dc')='duoc' RW('hok')='khong' RW('ntn')='nhu the nao' RW('kq')='ket qua' R('j')='gi' R('w')='qu' R('f')='ph' R('dz')='d' R('z')='d' Mc d y l nhng quy tc rt n gin, tuy nhin chng cng gip cc vitkos cng mt khi nhn vo cc on chat! Hy gip cc vitkos ci t thut ton ny. H s dng chng trnh ca bn vit mt plugin cho Yahoo Messenger :)
D liu
Gm mt dng duy nht cha mt cu chat vitko va nhn c. Cu chat c di khng vt qu 255 k t, ch gm cc k t latin in thng, khong trng v cc du cu. Cc t c cch nhau ng mt khong trng.
Kt qu
88 of 90
4/5/2008 10:00 PM
SPOJ Booklet
In ra mt dng l cu chat c dch theo thut ton trn.
V d
D liu chan wa. jo den luc co kq cha mun lam bai j nua :( Kt qu chan qua. gio den luc co ket qua cha mun lam bai gi nua :(
Hin cc vitkos quyt nh pht trin hiu qu hn thut ton ca mnh! Added by: Date: Time limit: Source limit: Languages: Resource: Ng Minh c 2008-04-01 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT vnoi.info
89 of 90
4/5/2008 10:00 PM
SPOJ Booklet
SPOJ Problem Set
2605. Conan Needs Help Again (Help Conan 4 )!

Problem code: CONANSP
Li ni sau trn u vi Thu Uyn,Conan ginh chin thng v phn thng ca anh l 100 im trn ioitrain v mt chuyn i du lch Hawai ( cn bn Thu Uyn cng rn chi nn t cc hi cao qu :)) =)),gi ch c ngm ngi thi ) . Conan vi vng ln ng khng qun mang theo 10 sut KFC Combo 1 ( v nghe ni Hawai khng bn KFC =))=)) ) Hawai l mt hn o gia i dng bao la. Trn hn o c cc h v trn nhng h ny li c nhng hn o nh m trn c th c h m trn c th c nhng hn o nh na v tng t. i dng c bc l 0, Hawai c bc 1. H trn Hawai c bc 2. Nh vy, mt h c bc w+1 nu n trn hn o c bc w v mt o c bc j+1 nu n nm trn h c bc j. Tt c cc h v o c bin l a gic khng t ct vi cc cnh lin tip vung gc vi nhau (// vi trc OX hoc OY) v nh c ta nguyn. Tt nhin cc ng bin ca h hay o khng ct nhau. Conan vn thch s yn tnh nn cu mun bit ni no c bc cao nht. Yu cu tnh bc cao nht ca o hay h Hawai.
Input
Dng u ghi n, l s ng gii hn (1 <= n <= 40000). Cc ng bin c m t trong cc dng tip theo, mi dng mt ng bin. S u tin trong mi dng ghi s chn k l s im to nn ng bin, 4 <= k <= 10000. Tip theo l k s x1, x2, , xk, 0 <= xi <= 10^8. Cc im to nn ng bin l (x1, x2), (x3, x2), (x3, x4) , (xk-1, xk), (x1, xk). Cc im ny c t trong ta Cc v ngc chiu kim ng h. Cc ng bin c in theo th t tha mn ng bin ca mi h c in sau ng bin hn o cha n v ng bin ca mi hn o c in sau ng bin ca h bao quanh n. Ch : khng cn dng qu 200000 im m t bn .
Output
Dng duy nht ghi bc ln nht ca hn o hay h.
Example
Input: 6 4 1 0 17 12 16 10 4 16 11 2 4 8 2 3 3 2 1 16 3 15 2 8 8 10 3 5 12 8 11 6 6 10 9 15 10 9 7 4 4 6 7 9 4 6 8 5 7 Output: 5
Phm Quang V 2008-04-01 1s 50000B C C++ PAS gpc PAS fpc JAVA TEXT bit ^o^
90 of 90
4/5/2008 10:00 PM

IOITRAIN Problems

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

IOITRAIN Problems

Uploaded by

Copyright:

Available Formats

SPOJ Booklet

Archives of the Vietnam Online Judge - IOI Training

Last updated: 2008-04-02 17:27:50

Enjoy problem-solving at the Vietnam Online Judge - IOI Training!

SPOJ Problem Set

Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2163. Kim tra chng trnh

END_IF ENDPROGRAM Kt qa 2 D liu: S S ENDPROGRAM Kt qa 1

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2166. Khun thp

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages:

SPOJ Problem Set

0.2041 1 45.5 2 70 4 21 D liu mu 4 2 40 30 80 50 2 4 Kt qa 0 1 50 3 50

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2197. on cao tro ca bn nhc

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2231. Cng vin Disneyland

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Khc Anh Tun - ICAMP 4

SPOJ Problem Set

2243. Mng my tnh

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2248. Truyn tin

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2250. Dy con di nht

Added by: Date:

Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2259. Chia a gic

Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

2267. Hon v di nht

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages: Resource:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages:

SPOJ Problem Set

Added by: Date: Time limit: Source limit: Languages:

SPOJ Problem Set

2336. Ma thin thch

Added by: Date: Time limit:

Source limit: Languages:

50000B C C++ PAS gpc PAS fpc JAVA TEXT