ï»??xml version="1.0" encoding="utf-8" standalone="yes"?>日韩欧美中文字幕精品,一区二区三区不卡在线视频,97国产成人精品视频http://www.aygfsteel.com/LittleDS/If the only tool you have is a hammer, you tend to see every problem as a nail.zh-cnWed, 11 Jun 2025 02:08:10 GMTWed, 11 Jun 2025 02:08:10 GMT60USACO ¾lˆäºŽåšå®Œäº?/title><link>http://www.aygfsteel.com/LittleDS/archive/2009/05/11/269990.html</link><dc:creator>杨磊</dc:creator><author>杨磊</author><pubDate>Mon, 11 May 2009 01:27:00 GMT</pubDate><guid>http://www.aygfsteel.com/LittleDS/archive/2009/05/11/269990.html</guid><wfw:comment>http://www.aygfsteel.com/LittleDS/comments/269990.html</wfw:comment><comments>http://www.aygfsteel.com/LittleDS/archive/2009/05/11/269990.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/LittleDS/comments/commentRss/269990.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/LittleDS/services/trackbacks/269990.html</trackback:ping><description><![CDATA[用了(ji¨£n)大概一个半月的旉™—´å§ï¼Œå½“然中间有大概一个礼拜空着来着<br /> <br /> ˜q™æ˜¯½W¬äºŒ‹Æ¡åšUSACOäº?ji¨£n)，½W¬ä¸€‹Æ¡æ˜¯é«˜ä(sh¨´)¸­çš„时候，那个时候的题目跟现在的都不太一æ øP¼Œä¸»è¦æ˜¯é¡ºåºï¼Œè€Œä¸”那个时候是用PASCAL写的<br /> <br /> 但是高ä(sh¨´)¸­çš„时候没有做完，卡在äº?ji¨£n)Section 5之前åQŒå…¶å®žæ˜¯å› äØ“(f¨´)很多东西不会(x¨¬)åQŒæ•°å­¦å…¶å®žä¹Ÿä¸å¤Ÿå¥½ï¼Œè‡³äºŽç†è§£çš„能力，不知道现在是不是也有所提高?sh¨´)?br /> <br /> 其实˜q™æ¬¡åšçš„òq¶ä¸æ˜¯éžå¸”R¡ºåˆ©ï¼Œæˆ‘不是牛人，不可能一天扫10几道题目那种åQŒç„¶åŽæ¯åˆ°é¢˜ç›®åŠä¸ªå°æ—¶å°±æžå®š<br /> <br /> 前面3个Section的题目还都不½Ž—是很难åQŒéƒ½æ˜¯è®­¾lƒåž‹çš„，都是教你½Ž—法怎么用，从Section 4开始就有比较难的题目了(ji¨£n)åQŒå°¤å…¶æ˜¯DP<br /> <br /> DP从高?sh¨´)¸­å¼€å§‹æˆ‘ž®±æ²¡æœ‰æ„Ÿè§‰ï¼Œé‚£æ—¶å€™å°±æœ‰äh跟我è¯ß_(d¨¢)¼Œåªèƒ½å¤šåšé¢˜ç›®åQŒä¹Ÿè®¸æˆ‘现在做的˜q˜ä(sh¨´)¸å¤Ÿå¤šå§ï¼Œæ€ÀL„Ÿè§‰DP是很有用很有用的东西åQŒæ‰€ä»¥ä¸€ç›´æƒ³å­¦å¥½<br /> <br /> 不管怎么æ øP¼ŒUSACOæ€È®—是磕¼‚•ç¢°¼„°çš„做完äº?ji¨£n)，应该在NoCowå’ŒGoogle的帮助下¾lˆäºŽåšå®Œäº?br /> <br /> 后面大部分题目我都看äº?ji¨£n)解题报告，有些½Ž—法惛_¾—出，但是不知道该怎么应用到题目之ä¸?br /> <br /> 现在发现˜q™ç‚¹æ‰æ˜¯æœ€é‡è¦çš„，½Ž—法模块谁不ä¼?x¨¬)写啊，都可以提前写好一个放在那里，但是问题是怎么把这个算法应用到题目ä¸?br /> <br /> 可能˜q™å°±æ˜¯æ‰€è°“的建模吧，把题目变形一下，然后跟我们已知的½Ž—法联系èµäh¥<br /> <br /> ˜q˜æœ‰å¦å¤–一¿Uæƒ…况，˜q™ä¸ªé¢˜ç›®çš„算法不是已知的ä»ÖM½•½Ž—法åQŒè¦è‡ªå·±åŽÀLƒ³çš„，˜q™æ‰æ˜¯çœŸæ­£è€ƒéªŒä¸€ä¸ªäh½Ž—法素养的时å€?br /> <br /> ž®±åƒTCO里面的题目，其实很多都是˜q™æ ·çš„，很少ä¼?x¨¬)给你一道题目让你直接去套一个算法的<br /> <br /> 可能原来我在˜q™æ–¹é¢çš„理解ž®±æœ‰åå·®åQŒæˆ‘总认为，你把所有的常见½Ž—法都练熟了(ji¨£n)åQŒæ‰€æœ‰çš„题目都可以横æ‰?br /> <br /> 但是问题ž®±æ˜¯åQŒä½ èƒ½ä¸èƒ½çœ‹å¾—出来哪道题目用哪种½Ž—法<br /> <br /> 而且åQŒå°±åƒDP˜q™ç§é¢˜ç›®åQŒå°±½Ž—你看出来了(ji¨£n)åQŒçŠ¶æ€è{¿UÀL–¹½E‹ä½ ä¹Ÿæœªå¿…写的出æ?br /> <br /> æ€ÖM¹‹˜q˜æ˜¯å­¦åˆ°äº?ji¨£n)很多，虽然¼‚•ç£•¼„°ç¢°åQŒä½†æ˜¯åšå®Œäº†(ji¨£n)100道题˜q˜æ˜¯ä¼?x¨¬)有收获ç?br /> <br /> 不知道下一个目标是什么SGU呢，˜q˜æ˜¯TCO<br /> <br /> 其实之所以喜‹Æ¢USACO的一个原因就是他ä¼?x¨¬)告诉你‹¹‹è¯•æ•°æ®åQŒä½ å¯ä»¥å¾ˆæ–¹ä¾¿çš„Debug<br /> <br /> 像OJ˜q™ç§åQŒä¸å‘Šè¯‰ä½ æµ‹è¯•æ•°æ®çš„åQŒå¦‚果遇åˆîCº†(ji¨£n)WAåQŒä½ ž®Þp¦æƒ³ç ´è„‘袋åŽÀLƒ³ä½ çš„½E‹åºå“ªé‡Œé”™äº†(ji¨£n)<br /> <br /> 而往往一个äh自己看自å·Þqš„½E‹åºçš„时候，是很隑֏‘现错误的åQŒè¿™ž®×ƒ¼š(x¨¬)让äh很郁é—øP¼ŒçœŸçš„是非帔Rƒé—?br /> <br /> 更何况，有些OJ真的是很è´Þqš„åQŒç”¨ä¸€äº›è¶…¾U§æ¶å¿?j¨©)的数据来钻你的½Iºå­ã€?br /> <br /> 不知道这样对不对åQŒä¹Ÿè®¸æ˜¯è€ƒéªŒä½ çš„¾l†å¿ƒ(j¨©)½E‹åº¦å?br /> <br /> SGU or TCO 呢？<br /> <br /> <img src ="http://www.aygfsteel.com/LittleDS/aggbug/269990.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/LittleDS/" target="_blank">杨磊</a> 2009-05-11 09:27 <a href="http://www.aygfsteel.com/LittleDS/archive/2009/05/11/269990.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>USACO Section 5回顾http://www.aygfsteel.com/LittleDS/archive/2009/05/11/269988.html杨磊杨磊Mon, 11 May 2009 01:16:00 GMThttp://www.aygfsteel.com/LittleDS/archive/2009/05/11/269988.htmlhttp://www.aygfsteel.com/LittleDS/comments/269988.htmlhttp://www.aygfsteel.com/LittleDS/archive/2009/05/11/269988.html#Feedback1http://www.aygfsteel.com/LittleDS/comments/commentRss/269988.htmlhttp://www.aygfsteel.com/LittleDS/services/trackbacks/269988.html TEXT Convex Hulls ½HåŒ… PROB Fencing the Cows  ½HåŒ…问题åQŒç›´æŽ¥å¿½ç•¥ï¼Œå·®ä¸å¤šæ‰€æœ‰çš„计算几何我都跌™¿‡äº?/td> PROB Starry Night  ­‘…çñ”éºÈƒ¦(ch¨³)题，用Flood Fill把所有的pattern全认出来åQŒç„¶åŽåˆ¤æ–­é‡å¤ï¼Œä¸é‡å¤å°±æ·ÕdŠ æ–°çš„ PROB Musical Themes  DP题，技巧在于如果两个序列是themeåQŒé‚£ä¹ˆç›¸é‚?c¨¨)š„两个number差相½{?/td> PROB Snail Trail  DFSåQŒæ²¡å•¥æŠ€å·?/td> PROB Electric Fences  刚开始以为是Divide&ConqueråQŒåŽæ¥å‘现跟那道题ä(sh¨´)¸ä¸€æ øP¼Œç›´æŽ¥æœçƒ¦(ch¨³)ž®±å¯ä»?/td> PROB Wisconsin Squares  搜烦(ch¨³)题，Testcase只有sample那一¾l?/td> TEXT Heuristics & Approximate Searches 启发式搜索，没看 PROB Milk Measuring  一道我看Analysis看了(ji¨£n)两天的DPåQŒå…¶å®žè¿˜æ˜¯æ²¡æœ‰æ·±åˆÈ†è§?/td> PROB Window Area  可以用矩形切割过 PROB Network of Schools  å¼ø™¿žé€šåˆ†é‡é¢˜ PROB Big Barn  最大子正方形，½Ž€å•çš„DP PROB All Latin Squares  搜烦(ch¨³)+剪枝 PROB Canada Tour  诡异的DP½Ž—法åQŒAnalysis的那个DP倒是˜q˜å¯ä»¥æŽ¥å—，不过Nocow上的ä¼ég¹Žéœ€è¦è¯æ˜Žï¼Œä½†æ˜¯åˆæ²¡æœ?/td> PROB Character Recognition  ˜q™é“题目都能用DPåQŒä¸å¾—不感叹DP的伟å¤?/td> PROB Betsy's Tour  又是搜烦(ch¨³)+剪枝 PROB TeleCowmunication  先把点è{化成边，然后求最ž®å‰² PROB Picture  ¼›ÀL•£åŒ?/td> PROB Hidden Passwords  搜烦(ch¨³)+KMP优化 PROB Two Five  ½Ž—是道难题吧åQŒAnalysis都看äº?ji¨£n)好久，DP真是无所不能
½W¬å…­ä¸ªSection的就不写äº?ji¨£n)，两个DP+一个牛叉的位运½Ž?br />
那个Cow XOR我估计我˜q™è¾ˆå­éƒ½ä¸ä¼š(x¨¬)忘记äº?ji¨£n)ã€?br />


杨磊 2009-05-11 09:16 发表评论
]]>USACO Section 4回顾http://www.aygfsteel.com/LittleDS/archive/2009/05/11/269981.html杨磊杨磊Mon, 11 May 2009 00:52:00 GMThttp://www.aygfsteel.com/LittleDS/archive/2009/05/11/269981.htmlhttp://www.aygfsteel.com/LittleDS/comments/269981.htmlhttp://www.aygfsteel.com/LittleDS/archive/2009/05/11/269981.html#Feedback0http://www.aygfsteel.com/LittleDS/comments/commentRss/269981.htmlhttp://www.aygfsteel.com/LittleDS/services/trackbacks/269981.html TEXT Optimization Techniques 讲怎么剪枝çš?/td> PROB Beef McNuggets  初看上去像是一道背包问题，但是用背包肯定超æ—Óž¼ŒåŽæ¥çœ‹äº†(ji¨£n)解题报告åQŒå‘现原来是数学é¢?/td> PROB Fence Rails  高维背包问题åQŒåªèƒ½æœç´?/td> PROB Fence Loops  其实是很½Ž€å•çš„一道最短èµ\问题åQŒæ¶å¿?j¨©)就恶å¿?j¨©)在图的è{åŒ?/td> PROB Cryptcowgraphy  非常恶心(j¨©)的搜ç´?剪枝 TEXT "Network Flow" Algorithms ¾|‘络‹¹ï¼Œæˆ‘第一‹Æ¡ä¼š(x¨¬)写网¾lœæµž®±æ˜¯çœ‹äº†(ji¨£n)˜q™ä¸ª½Ž—法 PROB Drainage Ditches  ¾|‘络‹¹ç»ƒä¹?f¨¤n)é¢?/td> PROB The Perfect Stall  最大匹配，匈牙利算æ³?/td> PROB Job Processing  ½W¬ä¸€é—®æ˜¯è´ªå¿ƒ(j¨©)åQŒç¬¬äºŒé—®åº”该也还是贪å¿?j¨©)，ž®±æ˜¯æŠŠç¬¬ä¸€é—®æœ€å¿«åšå®Œçš„¾l™ç¬¬äºŒé—®æœ€æ…¢åšå®Œçš„ PROB Cowcycles  直接枚ä‹D的好åƒ?/td> TEXT Big Numbers 高精åº?/td> PROB Buy Low, Buy Lower  ¾lå…¸DPåQŒæœ€é•¿ä¸‹é™åºåˆ—，可是问题是要求出çŽîCº†(ji¨£n)多少‹Æ¡ï¼ŒäºŽæ˜¯æˆ‘看äº?ji¨£n)解题报å?/td> PROB The Primes  搜烦(ch¨³)+剪枝åQŒè¦æ³¨æ„æœçƒ¦(ch¨³)的顺序，先是½W¬äº”行第五列åQŒç„¶åŽå¯¹è§’线åQŒç„¶åŽå…¶ä»?/td> PROB Street Race  关键路径åQŒåŽ»æŽ‰æ¯ä¸€ä¸ªèŠ‚点，然后看看èµïL(f¨¥ng)‚¹ä¸Žç»ˆç‚ÒŽ(gu¨©)˜¯å¦è¿žé€šï¼Œä¸è”通总说明是关键节点 PROB Letter Game  æžšä‹DåQŒåˆ†ä¸¤å—åQŒå…ˆæ‰‘Ö®Œæ•´çš„单词åQŒç„¶åŽæ‰¾pair PROB Shuttle Puzzle  刚开始以为搜索，后来看了(ji¨£n)解题报告åQŒå‘现原来有规律的，寒啊 PROB Pollutant Control  最ž®å‰²é—®é¢˜ PROB Frame Up  搜烦(ch¨³)题，用一张表来维护每个pattern的上下关¾p»ï¼Œå¯ä»¥å¤§é‡å‰ªæž

杨磊 2009-05-11 08:52 发表评论
]]>USACO Section3回顾http://www.aygfsteel.com/LittleDS/archive/2009/05/10/269942.html杨磊杨磊Sun, 10 May 2009 13:25:00 GMThttp://www.aygfsteel.com/LittleDS/archive/2009/05/10/269942.htmlhttp://www.aygfsteel.com/LittleDS/comments/269942.htmlhttp://www.aygfsteel.com/LittleDS/archive/2009/05/10/269942.html#Feedback0http://www.aygfsteel.com/LittleDS/comments/commentRss/269942.htmlhttp://www.aygfsteel.com/LittleDS/services/trackbacks/269942.html TEXT Minimal Spanning Trees 最ž®ç”Ÿæˆæ ‘(w¨¨i)åQŒç»å…¸çš„½Ž—法 PROB Agri-Net  最ž®ç”Ÿæˆæ ‘(w¨¨i)åQŒUSACO˜q™ç‚¹æ¯”较好，一般讲完了(ji¨£n)一个算法，都会(x¨¬)å‡ÞZ¸€é“练ä¹?f¨¤n)é¢?/td> PROB Score Inflation  背包问题 PROB Humble Numbers  ¾lå…¸é¢˜ç›®åQŒç®—法是用已有的丑数乘ä(sh¨´)¸Šé›†åˆé‡Œé¢çš„素数去生成新的丑数 PROB Shaping Regions  记得高ä(sh¨´)¸­çš„时候做˜q‡è¿™é“题目，当初用的¼›ÀL•£åŒ–çš„æ–ÒŽ(gu¨©)³•åQŒä¸˜q‡çŽ°åœ¨USACOæ—‰™™æ”ÒŽ(gu¨©)ˆ1¿U’了(ji¨£n)åQŒé‚£ä¸ªæ–¹æ³•å¯èƒ½ä¸è¡Œäº†(ji¨£n) PROB Contact  æžšä‹DåQŒè¾“出有点烦(ch¨³) PROB Stamps  一个背包问题的变åÅž TEXT Knapsack Problems 怎么到现在才介绍背包问题啊，前面都有好几道了(ji¨£n) PROB Factorials  高精度可以做åQŒä½†æ˜¯æˆ‘是去接保留了(ji¨£n)最后的6位数åQŒä¸€ç›´åˆ°æœ€åŽã€‚注意只保留一位数是不行的 PROB Stringsobits  直接生成çš?/td> PROB Spinning Wheels  又是一个我没看懂题的题目，然后看了(ji¨£n)标程åQŒåŽŸæ¥ç›´æŽ¥æžšä¸‘Ö°±è¡Œäº†(ji¨£n)åQŒå¦‚此简å?/td> PROB Feed Ratios  ¾U¿æ€§ä»£æ•°é¢˜ç›®ï¼Œç›´æŽ¥æŠŠæ–¹½E‹è§£å‡ºæ¥ž®±å¥½äº?/td> PROB Magic Squares  比较恶心(j¨©)çš„DFSåQŒä¸»è¦æ˜¯è½¬æ¢é‚£ä¸ªçŠ¶æ€è“v来比较麻çƒ?/td> PROB Sweet Butter  最短èµ\的题目，枚ä‹D每一个点作äØ“(f¨´)集合点，然后求最短èµ\ TEXT Eulerian Tours ‹Æ§æ‹‰å›žèµ\åQŒåˆæ˜¯ä¸€ä¸ªç»å…¸çš„½Ž—法 PROB Riding The Fences  ‹Æ§æ‹‰å›žèµ\的题ç›?/td> PROB Shopping Offers  DP问题åQŒçŠ¶æ€æ–¹½E‹åˆä¸æ˜¯æˆ‘自己想的，555ï½?/td> PROB Camelot  著名的亚瑟王问题åQŒæˆ‘是看äº?ji¨£n)解题报告才做出来çš?/td> PROB Home on the Range  DP问题åQŒæ‰¾æœ€å¤§å­æ­£æ–¹å½¢ï¼ŒåŽé¢˜q˜æœ‰ä¸€é“是找最大子矩åŞ的，隑ֺ¦å¤§äº†(ji¨£n)很多 PROB A Game  动态规划，好不å®ÒŽ(gu¨©)˜“自己推出来的状态è{¿UÀL–¹½E?/td> TEXT Computational Geometry 计算几何åQŒæ²¡çœ‹ï¼š(x¨¬)åQ?/td> PROB Closed Fences  计算几何的题目，跌™¿‡äº?/td> PROB American Heritage  二叉æ ?w¨¨i)遍历顺序题目，已知前序中序求后å?/td> PROB Electric Fence  一个è„P代求最优值的题目åQŒå…¶å®žå°±æ˜¯ä¸æ–­ç¾ƒ?y¨­u)®èŒƒå›´çš„æžšä‹D PROB Raucous Rockers  DPåQŒçŠ¶æ€æ–¹½E‹åˆæ˜¯çœ‹æ¥çš„åQŒä¼¼ä¹Žè¿™æ‰æ˜¯æ¯”较有难度的DPåQŒä¸åƒå‰é¢æœ‰äº›é¢˜åQŒçŠ¶æ€æ–¹½E‹ç®€ç›´æ˜¾è€Œæ˜“è§?/td>

杨磊 2009-05-10 21:25 发表评论
]]>USACO Section 2回顾http://www.aygfsteel.com/LittleDS/archive/2009/05/10/269923.html杨磊杨磊Sun, 10 May 2009 09:43:00 GMThttp://www.aygfsteel.com/LittleDS/archive/2009/05/10/269923.htmlhttp://www.aygfsteel.com/LittleDS/comments/269923.htmlhttp://www.aygfsteel.com/LittleDS/archive/2009/05/10/269923.html#Feedback0http://www.aygfsteel.com/LittleDS/comments/commentRss/269923.htmlhttp://www.aygfsteel.com/LittleDS/services/trackbacks/269923.html TEXT Graph Theory 很有用的东西åQŒå¾è®®ä»”¾l†çœ‹çœ?/td> TEXT Flood Fill Algorithms 其实ž®±æ˜¯DFS PROB The Castle  Flood FillåQŒç›´æŽ¥ç”¨ä¸Šé¢é‚£ç¯‡æ–‡ç« çš„算法就可以˜q?/td> PROB Ordered Fractions  2‹Æ¡åó@环，求出所有的分数åQŒçº¦åˆ†ï¼ŒåŽÀLŽ‰é‡å¤çš„，排序 PROB Sorting A Three-Valued Sequence  ˜q™é¢˜æˆ‘是看的¾l“题报告åQŒå…¶å®žå°±æ˜¯åˆ†å—来交换 åQŒé¦–先把所有的能一‹Æ¡äº¤æ¢å®Œæˆçš„处理掉，然后处理需要两‹Æ¡äº¤æ¢çš„ PROB Healthy Holsteins  忘记是贪å¿?j¨©)还是背包äº?ji¨£n)……-_-! PROB Hamming Codes  直接枚ä‹Dçš?/td> TEXT Data Structures è·Œ™¿‡ TEXT Dynamic Programming 动态规划啦åQŒéžå¸¸æœ‰å¿…要好好看，不过˜q™ç¯‡æ–‡ç« ä¹Ÿåªæ˜¯å¯¹äºŽåˆå­¦è€…很有用 PROB Preface Numbering  ¾|—马数字问题åQŒæŠŠæ‰€æœ‰å¯èƒ½çš„¾l„合先生成出来，4åQ?˜q™ç§åQŒç„¶åŽå°±æ˜¯æ±‚最ž®è¡¨½Cºæ–¹æ³?/td> PROB Subset Sums  背包问题åQŒè¿™é¢˜æˆ‘最开始居然没看出æ?#8230;…åQŒä»¥ä¸ºæ˜¯è¦æ·±æœçš„åQŒæ±—å•?/td> PROB Runaround Numbers  直接模拟的，注意判断是否是round number的条ä»?/td> PROB Party Lamps  我当初只注意åˆîCº†(ji¨£n)每个操作做两‹Æ¡å°±è·Ÿæ²¡åšä¸€æ øP¼Œæ‰€ä»¥ä¸€å…׃¹Ÿž®±æœ‰8¿Uæ“ä½œï¼ŒåŽæ¥çœ‹äº†(ji¨£n)解题报告åQŒå‘现其实只要处理前6个灯ž®±å¯ä»¥äº†(ji¨£n) PROB The Longest Prefix  DPåQŒæˆ‘看得别äh的解题报告，没办法DP是我的弱™å?/td> PROB Cow Pedigrees  DPåQŒè‡ªå·±æŽ¨äº?ji¨£n)一个差不多的状态方½E‹ï¼Œå¯æƒœé”™äº†(ji¨£n)…… PROB Zero Sum  直接模拟åQŒæŠŠè¡¨è¾¾å¼ç”Ÿæˆå‡ºæ¥ï¼Œç„¶åŽè®¡ç®—¾l“æžœž®Þp¡Œ PROB Money Systems  背包问题 PROB Controlling Companies  看了(ji¨£n)别äh的解题报告，˜q™é“题目用了(ji¨£n)一个变形的Floyd½Ž—法åQŒå¾ˆå·§å¦™ TEXT Shortest Paths ¾lå…¸½Ž—法å•?/td> PROB The Tamworth Two  模拟å?/td> PROB Overfencing  其实是比较恶å¿?j¨©)的一题，因äØ“(f¨´)要è{化那个图åQŒå‰©ä¸‹çš„ž®Þq®€å•äº†(ji¨£n)åQŒä»Žä¸¤ä¸ªexit开始BFSåQŒç„¶åŽæ‰¾æœ€å¤§å€?/td> PROB Cow Tours  å…ˆF(tu¨¢n)loydåQŒæŠŠå›‘Öˆ’分成两块åQŒç„¶åŽæžšä¸?/td> PROB Bessie Come Home  直接Floydž®Þp¡Œ PROB Fractions to Decimals  判断时候åó@环的条äšgž®±æ˜¯çœ‹ä½™æ•°æ˜¯å¦é‡å¤å‡ºçŽŽÍ¼Œå½“然åQŒåœ¨æˆ‘看äº?ji¨£n)Analysis之后åQŒå‘çŽîCº†(ji¨£n)æ›´åéy妙的办法

杨磊 2009-05-10 17:43 发表评论
]]>Cow XOR (USACO)http://www.aygfsteel.com/LittleDS/archive/2009/05/10/269919.html杨磊杨磊Sun, 10 May 2009 09:20:00 GMThttp://www.aygfsteel.com/LittleDS/archive/2009/05/10/269919.htmlhttp://www.aygfsteel.com/LittleDS/comments/269919.htmlhttp://www.aygfsteel.com/LittleDS/archive/2009/05/10/269919.html#Feedback0http://www.aygfsteel.com/LittleDS/comments/commentRss/269919.htmlhttp://www.aygfsteel.com/LittleDS/services/trackbacks/269919.html
不知道äØ“(f¨´)啥，是不是所有搞OIçš„äh在写题解的时候都喜欢ç”?#8220;提示”的办法，不直接把问题说清楚，而是隐隐¾U¦çº¦çš„公诉你该怎么做，然后你让你自己去惟ë€?br />
于是å¯ÆD‡´æˆ‘到现在都没有弄明白˜q™é“题目是怎么回事åQŒå°½½Ž¡ä»–们的做法有N多种åQŒä½†æ˜¯å½’根到底都是在搞一个叫做前¾~€çš„东è¥Ñ€?br />
下面˜q™ä¸ªæ˜¯æˆ‘在TopCoder上面扑ֈ°çš„一个牛人的解释åQŒç®—是英语写的比较好的，很通俗易懂çš?br /> 上面˜q™ç¯‡æ–‡ç« æˆ‘想我就不用再翻译了(ji¨£n)åQŒè¯´çš„比较清楚，但是他也没有¾l™å‡ºå…·ä½“的算法，不过思èµ\已经很清楚了(ji¨£n)

其实有了(ji¨£n)½W¬ä¸€æ¡æ€§è´¨ä¹‹åŽåQŒæœ€æœ´ç´ çš„办法就是枚举iå’ŒjåQŒæ‰€ä»¥ä¸ª2‹Æ¡åó@环，但是˜q™æ ·æ˜„¡„¶æ˜¯è¦TLEçš?br />
在没有更好的½Ž—法的前提下åQŒè¿™é“题目的½Ž—法ž®±æ˜¯½Iºé—´æ¢æ—¶é—ß_(d¨¢)¼Œåœ¨æˆ‘看来ž®±æ˜¯˜q™æ ·çš„ã€?br />
在看äº?ji¨£n)N多代码之后，我觉得还是USACOçš„Analysis的代码看上去比较¾ŸŽï¼Œä¸çŸ¥é“äØ“(f¨´)啥，那些用Hashå’ŒTrie的我都没看懂åQŒå¯èƒ½æ˜¯æˆ‘比较菜å?br />
下面我尝试着把USACO的代码解释一下，看看能不能说清楚åQŒå¾ˆé—憾åQŒç”±äºŽè¿™é“题目的巨型的输入数据，java肯定是没办法˜q‡çš„
 
 1 int main() {
 2     freopen("cowxor.in", "r", stdin);
 3     freopen("cowxor.out", "w", stdout);
 4     scanf("%i", &n);
 5     xr[0] = 0;
 6     for (a = 0; a < n; a++ ) {
 7         scanf("%d", &x);
 8         xr[a+1] = xr[a] ^ x;
 9     }
10     for (a = 0; a <= n; a++ ) {
11         prev[a][0] = a-1;
12         prev[a][1] = -1;
13         best[a] = a-1;
14     }
15     wyk = 22;
16     res = 0;
17     while (wyk--) {
18         for (a = 1; a <= n; a++ )
19             if (prev[a][0] == -1)
20                 prev[a][1] = -1;
21             else {
22                 if (xr[a] >> wyk != xr[prev[a][0]] >> wyk) {
23                     tmp[0] = prev[prev[a][0]][1];
24                     tmp[1] = prev[a][0];
25                 } else {
26                     tmp[0] = prev[a][0];
27                     tmp[1] = prev[prev[a][0]][1];
28                 }
29                 prev[a][0] = tmp[0];
30                 prev[a][1] = tmp[1];
31             }
32         fnd = false;
33         for (a = 1; a <= n; a++ )
34             if (0 <= best[a])
35                 if ((xr[a] >> wyk) % 2 != (xr[best[a]] >> wyk) % 2 ||
36                                       0 <= prev[best[a]][1])
37                     fnd = true;
38         if (fnd) {
39             res |= 1 << wyk;
40             for (a = 1; a <= n; a++ )
41                 if (0 <= best[a] &&
42                               (xr[a] >> wyk) % 2 == (xr[best[a]] >> wyk) % 2)
43                     best[a] = prev[best[a]][1];
44         }
45     }
46     for (a = 0; best[a] == -1; a++ );
47     printf("%d %d %d"n", res, best[a]+1, a);
48     return 0;
49 }

首先åQ?ï½?行，½E‹åºæŠŠä»Ž1开始到i位结束的所有的xor都求出来保存在了(ji¨£n)数组xor里面åQŒæˆ‘惌™¿™ä¸ªå°±æ˜¯äØ“(f¨´)äº?ji¨£n)方便后面用到xor的那个性质ã€?br />
10ï½?4行是一ä¸?初始化的˜q‡ç¨‹åQŒè¿™ä¸ªprev的定义应该可以从USACOçš„Analysis上面看到åQ?br />
  xr[pop[q][0]]'s and xr[q]'s binary representations are the same on positions e, e+1, etc., and pop[q][0] is biggest possible with 0 ≤ pop[q][0] < q. If there's no such pop[q][0] possible, then pop[q][0] = -1.

xr[pop[q][1]]'s and xr[q]'s binary representations are the same on positions e+2, e+2, etc., different on position e, and pop[q][1] is biggest possible with 0 ≤ pop[q][1] < q. If there's no such pop[q][1] possible, then pop[q][1] = -1.


我们要根据后面的循环来看˜q™ä¸ªprev数组的含ä¹?br />
外侧的åó@环的作用是每‹Æ¡å¤„理一位，ç”׃ºŽé¢˜ç›®ä¸­å·²¾lè¯´æ˜Žäº†(ji¨£n)åQŒæœ€å¤šåªæœ?1位，所以åó@çŽ?1‹Æ¡å°±å¯ä»¥äº?ji¨£n)ã€?br />
我们来看内侧的åó@çŽ?br />
18ï½?1行，å¯ÒŽ(gu¨©)‰€æœ‰çš„奶牛¾~–号循环一遍，得到的结果就是：(x¨¬)
对于当前的xor numberåQŒå¯¹äºŽè¿™ä¸ªxor number的前21 - wyk位，与他相同的那个xor number的位¾|®ï¼Œòq¶ä¸”åQŒè¿™ä¸ªä½¾|®è¦ž®½é‡çš„靠后ã€?br />
如果没有相同的，那么˜q™ä¸ªä½ç½®ž®±æ˜¯-1

˜q™æ ·åQŒç»˜q‡æ¯‹Æ¡åó@环之后，prev里面ž®±æ˜¯ä¸Žå½“前的xor number前k位相同的那个数的位置åQŒä¸€‹Æ¡ä¸€‹Æ¡åó@环，直到最后ã€?br />
prev[i][0]存的是当current bit也相同的时候的位置åQŒprev[i][1]存的是currnet bit不相同时候的位置åQŒäØ“(f¨´)什么要˜q™æ ·å‘¢ï¼Ÿ

˜q™å¯èƒ½å°±éœ€è¦è§£é‡Šä¸€ä¸?br />      if (xr[a] >> wyk != xr[prev[a][0]] >> wyk) {
                     tmp[0] = prev[prev[a][0]][1];
                     tmp[1] = prev[a][0];
     } else {
                     tmp[0] = prev[a][0];
                     tmp[1] = prev[prev[a][0]][1];
    }
如果当前比较的这一位相½{‰ï¼Œé‚£ä¹ˆä¹Ÿå°±æ„å‘³ç€prev[a][0]不用变，但是prev[i][1]却必™åÕd˜åŒ–，因äØ“(f¨´)当前的这一位，已经不是刚才比较的那一位了(ji¨£n)åQŒprev[a][1]应该½{‰äºŽæ­¤æ—¶çš„prev[a][0]çš„prev[a][1]åQŒæˆ‘惌™¿™ä¸ªåº”该不隄¡†è§£ã€?br />
另一斚w¢åQŒå¦‚果当前比较的˜q™ä¸€ä½ä¸ç›¸ç­‰çš„时候，那么prev[a][1]ž®±åº”该等于prev[a][0]äº?ji¨£n)，因äØ?f¨´)之前的所有位都相½{‰ï¼Œä¹‹åŽå½“前˜q™ä¸€ä½ä¸ç›? ½{‰ï¼Œ˜q™å°±æ˜¯prev[a][1]的定义。那么prev[a][0]的值呢åQŸæˆ‘们需要注意的时候，当我们处理到a的时候，prev[a][0]位置的å€ÆD‚¯å®? 是已¾lå¤„理过的了(ji¨£n)。那么prev[a][prev[a][0]][1]里面存的ž®±æ˜¯ä¸Žprev[a][0]在当前位不相½{‰çš„那个xor number的位¾|®ï¼Œæ³¨æ„åQŒbit只有0å’?åQŒprev[a][0]与当前的不相½{‰ï¼Œè€Œprev[a][prev[a][0]][1]又与prev[a] [0]不相½{‰ï¼Œæ‰€ä»¥å½“前的prev[a][1]肯定与prev[a][prev[a][0]][1]是相½{‰çš„。这ž®±æ˜¯ tmp[0] = prev[prev[a][0]][1];的含义ã€?br />
我再来看32ï½?7行，首先要知道best[q]的定义：(x¨¬)

if X would be equal biggest possible xor, then xr[best[q]] xor xr[q]'s in equal X's binary representation on positions e, e+1, etc., and best[q] is biggest possible with 0 ≤ best[q] < q. If there's no such best[q] possible, then best[q] = -1.

惌™¦å¾—到ž®½é‡å¤§çš„xoråQŒé‚£ä¹ˆå°±è¦å°½é‡è®©æ¯ä¸€ä½éƒ½ä¸ç›¸å?åQˆxr[a] >> wyk) % 2ž®±æ˜¯å–当前的二进制的最后一ä½?br />
˜q™æ®µä»£ç çš„作用就是找åQŒåˆ°å½“前位äØ“(f¨´)止，是否有两个xor numberåQŒä»–们的每一位都不相同，˜q™æ ·ž®Þpƒ½ä¿è¯å¼‚或¾l“果是最大的ã€?br />
接下来看38ï½?5çš„è¿™ŒDµä»£ç ï¼Œå› äØ“(f¨´)我们是从高ä(sh¨´)½åˆîC½Žä½æ¥å¤„理的，˜q™æ ·çš„话åQŒå¦‚果能保证高ä(sh¨´)½æ˜?åQŒé‚£ä¹ˆæ¯”你所有的低位都是1都管用：(x¨¬)åQ?br />
于是åQŒæ—¢ç„¶æˆ‘们找åˆîCº†(ji¨£n)高ä(sh¨´)½æ˜?的情况，那么我们ž®Þp¦è®°å½•ä¸‹ç»“æž?res

然后åQŒå‰©ä¸‹çš„那个循环ž®±æ˜¯æ›´æ–°best[a]

在所有的xor number中，如果当前位跟best[a]的当前位是相½{‰çš„åQŒé‚£ä¹ˆå°±æ›´æ–°best[a]åQŒå°†å…¶æ›´æ–îCØ“(f¨´)prev[best[a]][1]åQŒå°±æ˜¯é™¤äº?ji¨£n)当前ä½? 不相½{‰ï¼Œå…¶ä½™ä½ä¸å˜çš„那个xor numberåQŒè¿™æ ·å°±ä¿è¯äº?ji¨£n)从高?sh¨´)½å¼€å§‹ï¼Œæ¯ä¸€ä½éƒ½èƒ½å¤Ÿž®½é‡å–到1åQŒå› ä¸ºåªè¦é«˜?sh¨´)½å°½é‡æ˜?åQŒæˆ‘们的¾l“æžœž®Þpƒ½ž®½é‡çš„大ã€?br />
其实prev˜q™ä¸ªæ•°ç»„里面真正有用的是prev[q][1]

不知道我解释清楚äº?ji¨£n)没åQŒå…¶å®žè§£é‡Šäº†(ji¨£n)一遍，自己也清楚了(ji¨£n)很多ã€?

杨磊 2009-05-10 17:20 发表评论
]]>USACO Section 1回顾http://www.aygfsteel.com/LittleDS/archive/2009/05/09/269757.html杨磊杨磊Sat, 09 May 2009 07:05:00 GMThttp://www.aygfsteel.com/LittleDS/archive/2009/05/09/269757.htmlhttp://www.aygfsteel.com/LittleDS/comments/269757.htmlhttp://www.aygfsteel.com/LittleDS/archive/2009/05/09/269757.html#Feedback0http://www.aygfsteel.com/LittleDS/comments/commentRss/269757.htmlhttp://www.aygfsteel.com/LittleDS/services/trackbacks/269757.html Section 1.0 TEXT Introduction 介绍啦，我是没看 Section 1.1 TEXT Submitting Solutions 交你怎么提交½E‹åºçš„，可以看看 PROB Your Ride Is Here  最直接的方法是直接乘，然后mod 47,不过可以利用余数定理åQŒè¾¹ä¹˜è¾¹mod TEXT Contest Problem Types è·Œ™¿‡ TEXT Ad Hoc Problems è·Œ™¿‡ PROB Greedy Gift Givers  ½Ž€å•çš„模拟题，ž®±æ˜¯å¤„理名字的时候有点烦(ch¨³) PROB Friday the Thirteenth  数日期的题，我不知道一天天的模拟能不能˜q‡ï¼Œæˆ‘是只算äº?ji¨£n)周五这一天的ã€?/td> PROB Broken Necklace  也是模拟题，不过很要¾l†å¿ƒ(j¨©)åQŒæœ‰å¾ˆå¤šç‰ÒŽ(gu¨©)®Šæƒ…况åQŒæ¯”如全是wã€?/td> Section 1.2 TEXT Complete Search è·Œ™¿‡ PROB Milking Cows  直接模拟应该是过不了(ji¨£n)的， PROB Transformations  模拟题，直接把所有可能的pattern生成出来åQŒç„¶åŽæ¯”较就è¡?/td> PROB Name That Number  正确æ–ÒŽ(gu¨©)³•æ˜¯æŠŠå­—典里面的所有word转化成数字，然后比较?y¨­u)®Þp¡Œã€?/td> PROB Palindromic Squares  直接枚ä‹D PROB Dual Palindromes  DFSåQŒæ³¨æ„æœç´¢çš„时候，只要搜烦(ch¨³)回文数前一半就行，后面的直接反向复制一下就å¥?/td> Section 1.3 TEXT Greedy Algorithm è·Œ™¿‡ PROB Mixing Milk  ½Ž€å•çš„贪心(j¨©) PROB Barn Repair  也是贪心(j¨©)法，把最大的¾~éš™ž®±å‡ºæ¥ï¼Œç„¶åŽåŽ»è¦†ç›?/td> TEXT Winning Solutions è·Œ™¿‡ PROB Calf Flac  æžšä‹DåQŒä»Žæ²¡ä¸€ç‚¹å‘两边枚ä‹D PROB Prime Cryptarithm  直接枚ä‹DåQŒåæ­£åªæœ?个数 Section 1.4 TEXT More Search Techniques è·Œ™¿‡ PROB Packing Rectangles  恶心(j¨©)题，我没做：(x¨¬)P PROB The Clocks  看了(ji¨£n)一个牛人的¾l“题报告后过的，那位牛ähæ€È»“äº?ji¨£n)一个数¾l„，ž®±æ˜¯å¦‚何让表针è{一圈回到原来位¾|®çš„操作¾l„合 PROB Arithmetic Progressions  搜烦(ch¨³)åQŒç¡¬æœçš„ PROB Mother's Milk  BFSåQŒæŠŠæ‰€æœ‰çš„情况都弄出来 Section 1.5 TEXT Introduction to Binary Numbers è·Œ™¿‡ PROB Number Triangles  ¾lå…¸DP PROB Prime Palindromes  搜烦(ch¨³)åQŒç”Ÿæˆå›žæ–‡æ•°åQŒæ£€æŸ¥æ˜¯å¦æ˜¯ç´ æ•°ã€‚需要一点点剪枝åQˆé•¿åº¦æ˜¯å¶æ•°çš„回文数åQŒé™¤äº?1之外必然是合敎ͼŒå› å®ƒè‚¯å®šæ˜?1的倍数åQ?/td> PROB SuperPrime Rib  直接枚ä‹D PROB Checker Challenge  八皇后啊åQŒç”¨æœ€¾lå…¸çš„算法就能过åQŒä¸˜q‡å¦‚果想优化的非常快åQŒå¯èƒ½éœ€è¦å…¶ä»–的办法åQŒä¹Ÿæœ‰å¾ˆå¤æ‚çš„ã€?/td>

杨磊 2009-05-09 15:05 发表评论
]]>¾lˆäºŽæŠŠUSACO做完äº?/title><link>http://www.aygfsteel.com/LittleDS/archive/2009/05/09/269749.html</link><dc:creator>杨磊</dc:creator><author>杨磊</author><pubDate>Sat, 09 May 2009 05:50:00 GMT</pubDate><guid>http://www.aygfsteel.com/LittleDS/archive/2009/05/09/269749.html</guid><wfw:comment>http://www.aygfsteel.com/LittleDS/comments/269749.html</wfw:comment><comments>http://www.aygfsteel.com/LittleDS/archive/2009/05/09/269749.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/LittleDS/comments/commentRss/269749.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/LittleDS/services/trackbacks/269749.html</trackback:ping><description><![CDATA[<img alt="" src="http://www.aygfsteel.com/images/blogjava_net/littleds/USACO.jpg" width="567" height="173" /><br /> <br /> 感想å?qi¨¢ng)题解待会(x¨¬)儿再发åQšï¼‰(j¨ª)<br /> <br /> <img src ="http://www.aygfsteel.com/LittleDS/aggbug/269749.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/LittleDS/" target="_blank">杨磊</a> 2009-05-09 13:50 <a href="http://www.aygfsteel.com/LittleDS/archive/2009/05/09/269749.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Picture åQˆUSACOåQ?/title><link>http://www.aygfsteel.com/LittleDS/archive/2009/05/07/269352.html</link><dc:creator>杨磊</dc:creator><author>杨磊</author><pubDate>Thu, 07 May 2009 02:33:00 GMT</pubDate><guid>http://www.aygfsteel.com/LittleDS/archive/2009/05/07/269352.html</guid><wfw:comment>http://www.aygfsteel.com/LittleDS/comments/269352.html</wfw:comment><comments>http://www.aygfsteel.com/LittleDS/archive/2009/05/07/269352.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/LittleDS/comments/commentRss/269352.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/LittleDS/services/trackbacks/269352.html</trackback:ping><description><![CDATA[<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br /> <br /> Code highlighting produced by Actipro CodeHighlighter (freeware)<br /> http://www.CodeHighlighter.com/<br /> <br /> --><span style="color: #008080;"> 1</span> <span style="color: #0000ff;">import</span><span style="color: #000000;"> java.io.</span><span style="color: #000000;">*</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;"> 2</span> <span style="color: #0000ff;">import</span><span style="color: #000000;"> java.util.</span><span style="color: #000000;">*</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;"> 3</span> <span style="color: #008000;">/*</span><span style="color: #008000;"><br /> </span><span style="color: #008080;"> 4</span> <span style="color: #008000;">ID: yanglei4<br /> </span><span style="color: #008080;"> 5</span> <span style="color: #008000;">LANG: JAVA<br /> </span><span style="color: #008080;"> 6</span> <span style="color: #008000;">TASK:picture<br /> </span><span style="color: #008080;"> 7</span> <span style="color: #008000;">*/</span><span style="color: #000000;"><br /> </span><span style="color: #008080;"> 8</span> <span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">class</span><span style="color: #000000;"> picture {<br /> </span><span style="color: #008080;"> 9</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">int</span><span style="color: #000000;">[] level;<br /> </span><span style="color: #008080;">10</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> N;<br /> </span><span style="color: #008080;">11</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> ans </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #000000;">0</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">12</span> <span style="color: #000000;">    <br /> </span><span style="color: #008080;">13</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">class</span><span style="color: #000000;"> Line </span><span style="color: #0000ff;">implements</span><span style="color: #000000;"> Comparable</span><span style="color: #000000;"><</span><span style="color: #000000;">Line</span><span style="color: #000000;">></span><span style="color: #000000;"> {<br /> </span><span style="color: #008080;">14</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> s,t,p;<br /> </span><span style="color: #008080;">15</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">boolean</span><span style="color: #000000;"> start;<br /> </span><span style="color: #008080;">16</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> Line(</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> a, </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> b, </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> c, </span><span style="color: #0000ff;">boolean</span><span style="color: #000000;"> d) {<br /> </span><span style="color: #008080;">17</span> <span style="color: #000000;">            s </span><span style="color: #000000;">=</span><span style="color: #000000;"> a;<br /> </span><span style="color: #008080;">18</span> <span style="color: #000000;">            t </span><span style="color: #000000;">=</span><span style="color: #000000;"> b;<br /> </span><span style="color: #008080;">19</span> <span style="color: #000000;">            p </span><span style="color: #000000;">=</span><span style="color: #000000;"> c;<br /> </span><span style="color: #008080;">20</span> <span style="color: #000000;">            start </span><span style="color: #000000;">=</span><span style="color: #000000;"> d;<br /> </span><span style="color: #008080;">21</span> <span style="color: #000000;">        }<br /> </span><span style="color: #008080;">22</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> compareTo(Line o) {<br /> </span><span style="color: #008080;">23</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">this</span><span style="color: #000000;">.p </span><span style="color: #000000;">==</span><span style="color: #000000;"> o.p) {<br /> </span><span style="color: #008080;">24</span> <span style="color: #000000;">                </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">this</span><span style="color: #000000;">.start)<br /> </span><span style="color: #008080;">25</span> <span style="color: #000000;">                    </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> </span><span style="color: #000000;">-</span><span style="color: #000000;">1</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">26</span> <span style="color: #000000;">                </span><span style="color: #0000ff;">else</span><span style="color: #000000;"><br /> </span><span style="color: #008080;">27</span> <span style="color: #000000;">                    </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> </span><span style="color: #000000;">1</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">28</span> <span style="color: #000000;">            }<br /> </span><span style="color: #008080;">29</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> </span><span style="color: #0000ff;">this</span><span style="color: #000000;">.p </span><span style="color: #000000;"><</span><span style="color: #000000;"> o.p </span><span style="color: #000000;">?</span><span style="color: #000000;"> </span><span style="color: #000000;">-</span><span style="color: #000000;">1</span><span style="color: #000000;"> : </span><span style="color: #000000;">1</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">30</span> <span style="color: #000000;">        }<br /> </span><span style="color: #008080;">31</span> <span style="color: #000000;">    }<br /> </span><span style="color: #008080;">32</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">void</span><span style="color: #000000;"> Scan(Line[] L) {<br /> </span><span style="color: #008080;">33</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> i </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #000000;">0</span><span style="color: #000000;">;i </span><span style="color: #000000;"><=</span><span style="color: #000000;"> </span><span style="color: #000000;">20000</span><span style="color: #000000;">;i</span><span style="color: #000000;">++</span><span style="color: #000000;">)<br /> </span><span style="color: #008080;">34</span> <span style="color: #000000;">            level[i] </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #000000;">0</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">35</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> i </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #000000;">0</span><span style="color: #000000;">; i </span><span style="color: #000000;"><</span><span style="color: #000000;"> </span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> N;i</span><span style="color: #000000;">++</span><span style="color: #000000;">) {<br /> </span><span style="color: #008080;">36</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (L[i].start) {<br /> </span><span style="color: #008080;">37</span> <span style="color: #000000;">                </span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> j </span><span style="color: #000000;">=</span><span style="color: #000000;"> L[i].s;j </span><span style="color: #000000;"><</span><span style="color: #000000;"> L[i].t;j</span><span style="color: #000000;">++</span><span style="color: #000000;">) {<br /> </span><span style="color: #008080;">38</span> <span style="color: #000000;">                    level[j]</span><span style="color: #000000;">++</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">39</span> <span style="color: #000000;">                    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (level[j]</span><span style="color: #000000;">==</span><span style="color: #000000;">1</span><span style="color: #000000;">)<br /> </span><span style="color: #008080;">40</span> <span style="color: #000000;">                        ans</span><span style="color: #000000;">++</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">41</span> <span style="color: #000000;">                }<br /> </span><span style="color: #008080;">42</span> <span style="color: #000000;">            }<br /> </span><span style="color: #008080;">43</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">else</span><span style="color: #000000;"> {<br /> </span><span style="color: #008080;">44</span> <span style="color: #000000;">                </span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> j </span><span style="color: #000000;">=</span><span style="color: #000000;"> L[i].s;j </span><span style="color: #000000;"><</span><span style="color: #000000;"> L[i].t;j</span><span style="color: #000000;">++</span><span style="color: #000000;">) {<br /> </span><span style="color: #008080;">45</span> <span style="color: #000000;">                    level[j]</span><span style="color: #000000;">--</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">46</span> <span style="color: #000000;">                    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (level[j]</span><span style="color: #000000;">==</span><span style="color: #000000;">0</span><span style="color: #000000;">)<br /> </span><span style="color: #008080;">47</span> <span style="color: #000000;">                        ans</span><span style="color: #000000;">++</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">48</span> <span style="color: #000000;">                }<br /> </span><span style="color: #008080;">49</span> <span style="color: #000000;">            }<br /> </span><span style="color: #008080;">50</span> <span style="color: #000000;">        }<br /> </span><span style="color: #008080;">51</span> <span style="color: #000000;">    }<br /> </span><span style="color: #008080;">52</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">void</span><span style="color: #000000;"> done() </span><span style="color: #0000ff;">throws</span><span style="color: #000000;"> IOException {<br /> </span><span style="color: #008080;">53</span> <span style="color: #000000;">        BufferedReader f </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> BufferedReader(</span><span style="color: #0000ff;">new</span><span style="color: #000000;"> FileReader(</span><span style="color: #000000;">"</span><span style="color: #000000;">picture.in</span><span style="color: #000000;">"</span><span style="color: #000000;">));<br /> </span><span style="color: #008080;">54</span> <span style="color: #000000;">        PrintWriter out </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> PrintWriter(</span><span style="color: #0000ff;">new</span><span style="color: #000000;"> BufferedWriter(</span><span style="color: #0000ff;">new</span><span style="color: #000000;"> FileWriter(</span><span style="color: #000000;">"</span><span style="color: #000000;">picture.out</span><span style="color: #000000;">"</span><span style="color: #000000;">)));<br /> </span><span style="color: #008080;">55</span> <span style="color: #000000;">        N </span><span style="color: #000000;">=</span><span style="color: #000000;"> Integer.parseInt(f.readLine());<br /> </span><span style="color: #008080;">56</span> <span style="color: #000000;">        Line[] Lx </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> Line[</span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> N];<br /> </span><span style="color: #008080;">57</span> <span style="color: #000000;">        Line[] Ly </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> Line[</span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> N];<br /> </span><span style="color: #008080;">58</span> <span style="color: #000000;">        <br /> </span><span style="color: #008080;">59</span> <span style="color: #000000;">        </span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> i </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #000000;">0</span><span style="color: #000000;">; i </span><span style="color: #000000;"><</span><span style="color: #000000;"> N; i</span><span style="color: #000000;">++</span><span style="color: #000000;">) {<br /> </span><span style="color: #008080;">60</span> <span style="color: #000000;">            StringTokenizer st </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> StringTokenizer(f.readLine());<br /> </span><span style="color: #008080;">61</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> x1 </span><span style="color: #000000;">=</span><span style="color: #000000;"> Integer.parseInt(st.nextToken());</span><span style="color: #008000;">//</span><span style="color: #008000;">left x</span><span style="color: #008000;"><br /> </span><span style="color: #008080;">62</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> y1 </span><span style="color: #000000;">=</span><span style="color: #000000;"> Integer.parseInt(st.nextToken());</span><span style="color: #008000;">//</span><span style="color: #008000;">left y</span><span style="color: #008000;"><br /> </span><span style="color: #008080;">63</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> x2 </span><span style="color: #000000;">=</span><span style="color: #000000;"> Integer.parseInt(st.nextToken());</span><span style="color: #008000;">//</span><span style="color: #008000;">right x</span><span style="color: #008000;"><br /> </span><span style="color: #008080;">64</span> <span style="color: #000000;">            </span><span style="color: #0000ff;">int</span><span style="color: #000000;"> y2 </span><span style="color: #000000;">=</span><span style="color: #000000;"> Integer.parseInt(st.nextToken());</span><span style="color: #008000;">//</span><span style="color: #008000;">right y</span><span style="color: #008000;"><br /> </span><span style="color: #008080;">65</span> <span style="color: #000000;">            x1 </span><span style="color: #000000;">+=</span><span style="color: #000000;"> </span><span style="color: #000000;">10000</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">66</span> <span style="color: #000000;">            y1 </span><span style="color: #000000;">+=</span><span style="color: #000000;"> </span><span style="color: #000000;">10000</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">67</span> <span style="color: #000000;">            x2 </span><span style="color: #000000;">+=</span><span style="color: #000000;"> </span><span style="color: #000000;">10000</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">68</span> <span style="color: #000000;">            y2 </span><span style="color: #000000;">+=</span><span style="color: #000000;"> </span><span style="color: #000000;">10000</span><span style="color: #000000;">;<br /> </span><span style="color: #008080;">69</span> <span style="color: #000000;">            Lx[</span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> i] </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> Line(x1,x2,y1,</span><span style="color: #0000ff;">true</span><span style="color: #000000;">);<br /> </span><span style="color: #008080;">70</span> <span style="color: #000000;">            Lx[</span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> i </span><span style="color: #000000;">+</span><span style="color: #000000;"> </span><span style="color: #000000;">1</span><span style="color: #000000;">] </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> Line(x1,x2,y2,</span><span style="color: #0000ff;">false</span><span style="color: #000000;">);<br /> </span><span style="color: #008080;">71</span> <span style="color: #000000;">            Ly[</span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> i] </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> Line(y1,y2,x1,</span><span style="color: #0000ff;">true</span><span style="color: #000000;">);<br /> </span><span style="color: #008080;">72</span> <span style="color: #000000;">            Ly[</span><span style="color: #000000;">2</span><span style="color: #000000;"> </span><span style="color: #000000;">*</span><span style="color: #000000;"> i </span><span style="color: #000000;">+</span><span style="color: #000000;"> </span><span style="color: #000000;">1</span><span style="color: #000000;">] </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> Line(y1,y2,x2,</span><span style="color: #0000ff;">false</span><span style="color: #000000;">);<br /> </span><span style="color: #008080;">73</span> <span style="color: #000000;">        }<br /> </span><span style="color: #008080;">74</span> <span style="color: #000000;">        Arrays.sort(Lx);<br /> </span><span style="color: #008080;">75</span> <span style="color: #000000;">        Arrays.sort(Ly);<br /> </span><span style="color: #008080;">76</span> <span style="color: #000000;">        level </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> </span><span style="color: #0000ff;">int</span><span style="color: #000000;">[</span><span style="color: #000000;">20001</span><span style="color: #000000;">];<br /> </span><span style="color: #008080;">77</span> <span style="color: #000000;">        Scan(Lx);<br /> </span><span style="color: #008080;">78</span> <span style="color: #000000;">        Scan(Ly);<br /> </span><span style="color: #008080;">79</span> <span style="color: #000000;">        out.println(ans);<br /> </span><span style="color: #008080;">80</span> <span style="color: #000000;">        <br /> </span><span style="color: #008080;">81</span> <span style="color: #000000;">        out.close();    <br /> </span><span style="color: #008080;">82</span> <span style="color: #000000;">    }<br /> </span><span style="color: #008080;">83</span> <span style="color: #000000;">    </span><span style="color: #0000ff;">public</span><span style="color: #000000;"> </span><span style="color: #0000ff;">static</span><span style="color: #000000;"> </span><span style="color: #0000ff;">void</span><span style="color: #000000;"> main(String[] args) </span><span style="color: #0000ff;">throws</span><span style="color: #000000;"> IOException {<br /> </span><span style="color: #008080;">84</span> <span style="color: #000000;">        picture t </span><span style="color: #000000;">=</span><span style="color: #000000;"> </span><span style="color: #0000ff;">new</span><span style="color: #000000;"> picture();<br /> </span><span style="color: #008080;">85</span> <span style="color: #000000;">        t.done();<br /> </span><span style="color: #008080;">86</span> <span style="color: #000000;">        System.exit(</span><span style="color: #000000;">0</span><span style="color: #000000;">);<br /> </span><span style="color: #008080;">87</span> <span style="color: #000000;">    }<br /> </span><span style="color: #008080;">88</span> <span style="color: #000000;">}<br /> </span><span style="color: #008080;">89</span> </div> <br /> ˜q™é“题用äº?ji¨£n)离散化的方æ?br /> <br /> 其实最朴素的方法就是在一ä¸?0000*20000的矩阵上面把所有的ç‚ÒŽ(gu¨©)å‡ºæ¥åQŒç„¶åŽæŠŠ˜q™äº›ç‚¹çš„周长½Ž—出来，不过½Ž—周长这一步也是很éºÈƒ¦(ch¨³)çš„ã€?br /> <br /> å› äØ“(f¨´)毕竟˜q˜æœ‰å¯èƒ½å‡ºçŽ°“½Iºå¿ƒ(j¨©)”的情å†?br /> <br /> 用离散化的方法就是想办法只数每条¾U¿æ®µåQŒè€Œä¸åŽÈ®¡å…¶ä»–½Iºç™½çš„地æ–ÒŽ(gu¨©)˜¯æ€Žä¹ˆæ ïL(f¨¥ng)š„ã€?br /> <br /> ç”׃ºŽæˆ‘们是需要算周长的，所以只需要看矩åŞ的四条边ž®±å¯ä»¥äº†(ji¨£n)ã€?br /> <br /> 然后åQŒæˆ‘们就是先看所有的横边åQŒå†çœ‹ç«–辏V€?br /> <br /> 先把横边全部选出来，攑֜¨ä¸€ä¸ªæ•°¾l„里面，然后排序åQŒä»Žä¸‹åˆ°ä¸Šã€?br /> <br /> 一个矩形的两条边要分成始边和终边，排序的时候，如果¾Uµåæ ‡ç›¸åŒï¼Œé‚£ä¹ˆåº”该把始è¾ÒŽ(gu¨©)”¾åœ¨ç»ˆè¾V€?br /> <br /> 如果遇到始边åQŒé‚£ä¹ˆå°±æŠŠè¿™æ¡è¾¹ä¸Šé¢çš„所有点level[j]加一ã€?br /> <br /> 如果遇到¾lˆè¾¹åQŒå°±æŠŠé‚£æ¡è¾¹ä¸Šæ‰€æœ‰çš„点的level[j]减一<br /> <br /> 于是åQŒå½“一条边上的点的leveæ˜?的时候，那么ž®Þp¯´æ˜Žè¿™æ¡è¾¹è‚¯å®šæ˜¯å§‹è¾¹è¾¹¾~˜ï¼Œæ‰€ä»¥è¦ans++<br /> <br /> 另一¿Uæƒ…况，当一条边上的点的levelæ˜?的时候，那么说明˜q™ä¸ªç‚ÒŽ(gu¨©)˜¯¾lˆè¾¹è¾¹ç¼˜åQŒæ‰€ä»¥ans++<br /> <br /> ˜q™æ ·æ‰«å®Œæ¨ªè¾¹å†æ‰«ç«–è¾¹ã€?br /> <br /> 最后的ansž®±æ˜¯å‘¨é•¿äº?ji¨£n)ã€?br /> <br /> 不过˜q™ä¸ª½Ž—法的时间效率åƈ不是非常的好åQŒå› ä¸ºæ•°æ®æ¯”较弱åQˆå¯èƒ½æ˜¯˜q™æ ·åQ?br /> <br /> 如果真的是有5000个矩形，没个矩åŞ都是20000×20000的，那么可能ä¼?x¨¬)超æ?br /> <br /> <img src ="http://www.aygfsteel.com/LittleDS/aggbug/269352.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/LittleDS/" target="_blank">杨磊</a> 2009-05-07 10:33 <a href="http://www.aygfsteel.com/LittleDS/archive/2009/05/07/269352.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>USACO¾lˆäºŽåˆ?.5äº?/title><link>http://www.aygfsteel.com/LittleDS/archive/2009/05/06/269313.html</link><dc:creator>杨磊</dc:creator><author>杨磊</author><pubDate>Wed, 06 May 2009 15:57:00 GMT</pubDate><guid>http://www.aygfsteel.com/LittleDS/archive/2009/05/06/269313.html</guid><wfw:comment>http://www.aygfsteel.com/LittleDS/comments/269313.html</wfw:comment><comments>http://www.aygfsteel.com/LittleDS/archive/2009/05/06/269313.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/LittleDS/comments/commentRss/269313.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/LittleDS/services/trackbacks/269313.html</trackback:ping><description><![CDATA[虽然ä»?.1开始，大部分题目都要借助于NoCow和网上的解题报告åQŒä½†æ˜¯è¿˜æ˜¯å­¦åˆîCº†(ji¨£n)不少的东è¥Ñ€?br /> <br /> 原来认äØ“(f¨´)只要熟练的掌握各¿Uç®—法，那就可以随便åŽÕdˆ‡é¢˜ï¼ŒçŽ°åœ¨å‘现其实不是˜q™æ ·ã€?br /> <br /> 有很多题目，都需要进行一些è{化，也可以说是徏模，才能套用现成的算æ³?br /> <br /> 而有一些题目，æ ÒŽ(gu¨©)œ¬ž®±æ²¡æœ‰çŽ°æˆçš„½Ž—法åQŒåªèƒ½ä½ è‡ªå·±åŽÀLƒ³<br /> <br /> ˜q™ç§½Ž—法基本上是不属于ä“Q何一¾cȝš„<br /> <br /> ˜q˜æœ‰ä¸€äº›æ¯”如说剪枝åQŒè™½ç„¶æœç´¢è°éƒ½ä¼š(x¨¬)åQŒBrute Force谁都ä¼?x¨¬)写åQŒä½†æ˜¯å‰ªæžå´ä¸æ˜¯è°éƒ½èƒ½å†™çš„出来的<br /> <br /> ˜q™å°±éœ€è¦ä¸€äº›æ•°å­¦åŠŸåº?br /> <br /> 现在发现˜q™ä¸ªä¸œè¥¿å¿…须要长òq´ç¯æœˆçš„¿U¯ç¯æ‰èƒ½å¤Ÿè¾¾åˆ°é©¾è½Õd°±ç†Ÿçš„境界ã€?br /> <br /> 但是ž®Þq®—那样åQŒä¹Ÿä¸èƒ½ä¿è¯æ‰€æœ‰çš„题目都会(x¨¬)做ã€?br /> <br /> <img src ="http://www.aygfsteel.com/LittleDS/aggbug/269313.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/LittleDS/" target="_blank">杨磊</a> 2009-05-06 23:57 <a href="http://www.aygfsteel.com/LittleDS/archive/2009/05/06/269313.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss> <footer> <div class="friendship-link"> <a href="http://www.aygfsteel.com/" title="狠狠久久亚洲欧美专区_中文字幕亚洲综合久久202_国产精品亚洲第五区在线_日本免费网站视频">狠狠久久亚洲欧美专区_中文字幕亚洲综合久久202_国产精品亚洲第五区在线_日本免费网站视频</a> </div> </footer> Ö÷Õ¾Ö©Öë³ØÄ£°å£º <a href="http://" target="_blank">À´±öÊÐ</a>| <a href="http://" target="_blank">½ðÐã</a>| <a href="http://" target="_blank">¾üÊÂ</a>| <a href="http://" target="_blank">Õ´»¯ÏØ</a>| <a href="http://" target="_blank">»ôÇñÏØ</a>| <a href="http://" target="_blank">µ±ÑôÊÐ</a>| <a href="http://" target="_blank">½ªÑßÊÐ</a>| <a href="http://" target="_blank">Ò³ÓÎ</a>| <a href="http://" target="_blank">¸®¹ÈÏØ</a>| <a href="http://" target="_blank">¶«Ã÷ÏØ</a>| <a href="http://" target="_blank">³¤¸ðÊÐ</a>| <a href="http://" target="_blank">ÂÀÁºÊÐ</a>| <a href="http://" target="_blank">ËÉÅËÏØ</a>| <a href="http://" target="_blank">÷ÖÝÊÐ</a>| <a href="http://" target="_blank">èï³ÇÏØ</a>| <a href="http://" target="_blank">°²ÇìÊÐ</a>| <a href="http://" target="_blank">³Ê¹±ÏØ</a>| <a href="http://" target="_blank">ÓÀÐÂÏØ</a>| <a href="http://" target="_blank">Çì³ÇÏØ</a>| <a href="http://" target="_blank">ÑÓ¼ªÊÐ</a>| <a href="http://" target="_blank">ÐËÈÊÏØ</a>| <a href="http://" target="_blank">ÄÛ½­ÏØ</a>| <a href="http://" target="_blank">³¤ÖÎÊÐ</a>| <a href="http://" target="_blank">Ǭ°²ÏØ</a>| <a href="http://" target="_blank">½­³Ç</a>| <a href="http://" target="_blank">³ö¹ú</a>| <a href="http://" target="_blank">¶Ø»ÍÊÐ</a>| <a href="http://" target="_blank">ÁºÆ½ÏØ</a>| <a href="http://" target="_blank">´ó¶É¿ÚÇø</a>| <a href="http://" target="_blank">×ÛÒÕ</a>| <a href="http://" target="_blank">ÀÖɽÊÐ</a>| <a href="http://" target="_blank">Áúº£ÊÐ</a>| <a href="http://" target="_blank">ÐÇ×ù</a>| <a href="http://" target="_blank">½­ÃÅÊÐ</a>| <a href="http://" target="_blank">ÐìÎÅÏØ</a>| <a href="http://" target="_blank">ºÍÁúÊÐ</a>| <a href="http://" target="_blank">ÐÂÒ°ÏØ</a>| <a href="http://" target="_blank">°¢¿ËËÕÊÐ</a>| <a href="http://" target="_blank">Ð˺ÍÏØ</a>| <a href="http://" target="_blank">Üþ¾­ÏØ</a>| <a href="http://" target="_blank">°²ÔóÏØ</a>| <script> (function(){ var bp = document.createElement('script'); var curProtocol = window.location.protocol.split(':')[0]; if (curProtocol === 'https') { bp.src = 'https://zz.bdstatic.com/linksubmit/push.js'; } else { bp.src = 'http://push.zhanzhang.baidu.com/push.js'; } var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(bp, s); })(); </script> </body>