锘??xml version="1.0" encoding="utf-8" standalone="yes"?>国产精品欧美久久久久天天影视,亚洲国产精品久久电影欧美,久久综合伊人77777http://www.shnenglu.com/qhpeklh5959/category/20197.html鏌崇誕鍥犻璧?/description>zh-cnSat, 13 Apr 2013 07:14:39 GMTSat, 13 Apr 2013 07:14:39 GMT60HDU1025 Constructing Roads In JGShining's Kingdomhttp://www.shnenglu.com/qhpeklh5959/articles/199286.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Tue, 09 Apr 2013 12:18:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/199286.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/199286.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/199286.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/199286.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/199286.html棰樼洰閾炬帴錛?a style="color: #6a3906; text-decoration: none;">http://acm.hdu.edu.cn/showproblem.php?pid=1025

棰樻剰澶ф灝辨槸緇欎綘涓澶у爢鐨勫煄甯傦紝宸﹁竟鐨勬暟琛ㄧず榪欎釜鍩庡競緙轟粈涔堢墿璧勶紝鍙寵竟鐨勬暟琛ㄧず閭d釜鐗╄祫浠庡摢涓煄甯傚線閲岃繍錛屼袱涓煄甯備箣闂撮渶瑕侀摼鎺ラ亾璺紝闂笉浜ゅ弶鐨勬儏鍐典笅錛屾渶澶氳兘榪炲灝戞潯銆傝繖閬撻鍘熸湰搴旇鏄竴涓渶闀垮叕鍏卞瓙搴忓垪錛屼絾鏄棤濂堜粬緇欑殑鏁版嵁鑼冨洿澶ぇ錛孡CS鐨勫仛娉曟槑鏄句笉婊¤凍錛屾墍浠ラ鍏堟垜浠彲浠ユ妸鍙寵竟鐨勬暟鏄犲皠鍒板乏杈規潵錛岃繖鏍峰氨杞寲鎴愭眰鏈闀夸笉涓嬮檷瀛愬簭鍒楃殑闂錛屽浜庢渶闀夸笉涓嬮檷瀛愬簭鍒楋紝鏈変竴縐岲P+浜屽垎鐨勬眰娉曪紝鍙互鍦╪logn鐨勬儏鍐典笅瀹岀編瑙e喅銆?/p>

鎬濊礬澶ф灝辨槸dp鏁扮粍璁板綍鐨勬槸鍒板綋鍓嶉暱搴︾殑鏈闈犲墠鐨勫厓绱狅紝姣忛亣鍒頒竴涓柊鍏冪礌錛屽湪dp鏁扮粍涓簩鍒嗘煡鎵懼埌灝忎簬瀹冪殑鏈澶у厓绱犵殑浣嶇疆錛屽湪閭i噷鏇存柊鍒板畠鐨勬渶闀夸笉涓嬮檷瀛愬簭鍒楋紝榪欎釜綆楁硶鐗涢煎氨鐗涢煎湪浜屽垎閭d竴姝ヤ簡錛屽惁鍒欎篃涓嶄細鍋氬埌nlogn鐨勬椂闂村鏉傚害

view code



]]>
HDU1003 Max Sum && HDU1024 Max Sum Plus Plushttp://www.shnenglu.com/qhpeklh5959/articles/199285.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Tue, 09 Apr 2013 12:17:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/199285.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/199285.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/199285.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/199285.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/199285.html棰樼洰閾炬帴錛?a style="color: #6a3906; text-decoration: none;">http://acm.hdu.edu.cn/showproblem.php?pid=1003

1003鏄枩闂諱箰瑙佺殑鏈澶ц繛緇瓙涓插拰錛岀粡鍏哥殑鍔ㄦ佽鍒掗鐩紝緇忓吀褰掔粡鍏革紝鎴戠‘瀹炴槸鍒氬垰鍋?#8230;…鍦ㄨ繖閬撻涓紝鎴戜滑闇瑕佷繚璇佺殑鏄湪璁$畻榪囩▼涔嬩腑錛岃綆楃殑鍜屾槸涓鐩村鍔犵殑錛屽鏋滅鍒頒簡璁╁拰鍑忓皯鐨勫厓绱狅紝鐩存帴鎶婂拰鏇存柊涓?錛屽茍涓旀洿鏂頒復鏃墮鎸囬拡錛屾瘡鎵懼埌涓涓洿浼樼殑瑙o紝鎶婄湡姝g殑棣栨寚閽堝拰灝炬寚閽堟洿鏂幫紝鏁翠釜榪囩▼涓竴鐩翠繚璇佺殑鏄拰鏄掑鐨勩傛敞鎰忔垜璇寸殑鏄潪鍏ㄨ礋鐨勬儏鍐點?br />

view code
棰樼洰閾炬帴錛?a style="color: #6a3906; text-decoration: none;">http://acm.hdu.edu.cn/showproblem.php?pid=1024

 

榪欓亾棰樺帀瀹充簡錛岃姹傚湪n涓暟閲岄潰姹俶涓渶澶у瓙孌靛拰錛岃姹傛渶緇堢殑鍜屾渶澶э紝鍏跺疄灝辨槸璁$畻m嬈★紝鍥犱負榪欐涓嶇敤璁板綍鍖洪棿鐨勯灝懼厓绱狅紝鎵浠ュ叾瀹炴瘮涓婁竴閬撻濂藉啓涓浜涖?br />

view code



]]>
POJ3280 Cheapest Palindromehttp://www.shnenglu.com/qhpeklh5959/articles/199282.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Tue, 09 Apr 2013 12:15:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/199282.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/199282.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/199282.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/199282.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/199282.html棰樼洰閾炬帴錛?a style="color: #6a3906; text-decoration: none;">http://poj.org/problem?id=3280

棰樼洰澶ф剰灝辨槸緇欎綘涓涓瓧絎︿覆錛屽拰瀛楃涓蹭腑姣忎竴涓瓧姣嶅垹闄ゆ垨鑰呮坊鍔犳墍闇瑕佷粯鍑虹殑浠d環錛岄棶鎶婂畠鍙樻垚涓涓洖鏂囧瓧涓叉墍闇瑕佺殑鏈灝戠殑浠d環銆?/p>

棣栧厛鏄庣‘涓涓棶棰橈紝濡傛灉鎴戜滑鍦ㄥ瓧絎︿覆涓煇涓涓綅緗垹闄や竴涓瓧絎︼紝閭d箞涓瀹氳兘鎵懼埌涓涓瓑浠風殑娣誨姞鐨勬柟娉曪紝鎵浠ュ彲浠ユ妸鍒犻櫎鍜屾坊鍔犵粺涓鍒頒竴璧鳳紝鐒跺悗榪欓亾棰樼殑鐘舵佸氨綆鍗曚簡銆?/p>

dp[i][j]琛ㄧず鐨勬槸鍖洪棿[i, j]鍐呭艦鎴愬洖鏂囦覆鎵闇瑕佺殑鏈灝戠殑浠d環錛岃繖鏍鋒垜浠氨鍙互鐢變竴涓崟浣嶅瓧絎﹀悜澶栨墿灞曪紝鐘舵佽漿縐繪柟紼嬪氨搴旇鏄痙p[j][i] = min(dp[j + 1][i] + cost[s[j] - 'a'], dp[j][i - 1] + cost[s[i] - 'a'])錛屽彟澶栧鏋滃尯闂寸殑棣栧熬瀛楃閮芥槸涓鏍風殑璇濓紝閭d箞棣栧熬瀛楃鍏ㄩ兘鍒犲幓榪樻槸涓涓洖鏂囦覆錛岃繖鏍蜂竴鏉ュ啀鎶婁袱涓唬浠峰仛涓涓瘮杈冨氨鍙互浜嗗惂銆?br />

褰撶劧錛屽叾瀹炴渶鍒濈殑鎯蟲硶鏄墿灞曞嚭鏉ュ洓涓姸鎬侊紝灝辨槸棣栧垹闄わ紝棣栨坊鍔狅紝灝懼垹闄わ紝灝炬坊鍔狅紝鐢辨鎵╁睍寮鏉ユ眰涓涓渶灝忓鹼紝涓嶈繃鐪嬩簡涓涓嬭В棰樻姤鍛婏紝鍐嶅姞涓婂拰瀛﹂暱浠琘Y涓浼氬効錛屽彂鐜頒簡鍙互緇熶竴鐨勯棶棰橈紝灝辨兂鍑烘潵浜嗐?br />

view code



]]>
TYVJP1114http://www.shnenglu.com/qhpeklh5959/articles/195747.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Tue, 27 Nov 2012 14:39:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/195747.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/195747.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/195747.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195747.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/195747.htmldp[i][j]琛ㄧず浣跨敤鍓峣涓按鏅跺潡鐨勬椂鍊欙紝涓ゅ駭濉旂殑璇樊涓簀鏃朵袱搴у鍏辨湁鐨勬渶楂橀珮搴︼紝瀵逛簬絎琲涓湪鍧楋紝鏈変笁縐嶆儏鍐碉紝絎竴縐嶄笉鏀撅紝絎簩縐嶆斁鍦ㄥ叾涓尐濉斾笂錛屾鏃舵洿鏂拌宸間互鍙婂叡鏈夌殑鏈楂橀珮搴﹀鹼紝絎笁縐嶆儏鍐墊斁鍦ㄩ珮濉斾笂錛屾鏃朵粎浠呮洿鏂拌宸箋?br />
view code


]]>
POJ3628鍙堟槸涓涓?1鑳屽寘http://www.shnenglu.com/qhpeklh5959/articles/195625.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Sat, 24 Nov 2012 08:10:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/195625.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/195625.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/195625.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195625.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/195625.html
vidw code


]]>
HDU1864http://www.shnenglu.com/qhpeklh5959/articles/195624.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Sat, 24 Nov 2012 07:24:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/195624.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/195624.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/195624.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195624.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/195624.html榪樺ソ鏍蜂緥鍚ф墍鏈夌殑闄烽槺閮界粰浜嗭紝鍚﹀垯涓嶇煡閬撹WA澶氬皯嬈★紝鍙仺鐨勬槸鎴慍E浜嗕竴嬈★紝TMD澶嶅埗綺樿創鐨勬椂鍊欐悶閿欎簡錛岃繖瑕佹槸姝e紡姣旇禌錛岄偅涓綒鏃跺晩……
view code


]]>
POJ2063瑙i鎶ュ憡http://www.shnenglu.com/qhpeklh5959/articles/195575.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Thu, 22 Nov 2012 13:35:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/195575.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/195575.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/195575.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195575.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/195575.html
view code


]]>
POJ1014瑙i鎶ュ憡鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/195243.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Thu, 15 Nov 2012 13:32:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/195243.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/195243.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/195243.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195243.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/195243.html</trackback:ping><description><![CDATA[榪欓亾棰樻垜紜疄鍌婚間簡……<br />澶氶噸鑳屽寘+浜岃繘鍒舵媶鍒嗕紭鍖栵紝濡傛灉dp[sum/2]=sum/2灝辮鏄庤兘澶熷潎鍒嗭紝鍚﹀垯涓嶈兘鍧囧垎銆?br />鎴戝氨鏄瘡鎯沖埌涓涓簨鍎?#8230;…濡傛灉sum鏄鏁扮洿鎺ユ灉鏂殑涓嶈錛岃繕鏈変竴涓敊璇紝灝辨槸鎶奵ontinue鍐欐垚浜唕eturn 0……鍌婚間簡……<br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_213155" onclick="this.style.display='none'; Code_Closed_Text_213155.style.display='none'; Code_Open_Image_213155.style.display='inline'; Code_Open_Text_213155.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_213155" style="display: none" onclick="this.style.display='none'; Code_Open_Text_213155.style.display='none'; Code_Closed_Image_213155.style.display='inline'; Code_Closed_Text_213155.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_213155" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">view code</span><span id="Code_Open_Text_213155" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">iostream</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstdio</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstring</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">using</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">namespace</span><span style="color: #000000; "> std;<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> max(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> a, </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> b)<br />{<br />    </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (a </span><span style="color: #000000; ">></span><span style="color: #000000; "> b) </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> a;<br />    </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> b;<br />}<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> num[</span><span style="color: #000000; ">10</span><span style="color: #000000; ">], dp[</span><span style="color: #000000; ">120000</span><span style="color: #000000; ">], t, tot, i, j, sum, w[</span><span style="color: #000000; ">400000</span><span style="color: #000000; ">], n </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: #0000FF; ">bool</span><span style="color: #000000; "> ju </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: #0000FF; ">while</span><span style="color: #000000; "> (n)<br />    {<br />        sum </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; tot </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; ju </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />        memset(w, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(w));<br />        </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> </span><span style="color: #000000; ">6</span><span style="color: #000000; ">; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        {<br />            cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> num[i];<br />            sum </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> num[i] </span><span style="color: #000000; ">*</span><span style="color: #000000; "> i;<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">!=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">) ju </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        }<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (sum </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; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />        {<br />            cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">Collection #</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> n</span><span style="color: #000000; ">++</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">:</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">Can't be divided.</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br />            </span><span style="color: #0000FF; ">continue</span><span style="color: #000000; ">;<br />        }<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (ju </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: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> </span><span style="color: #000000; ">6</span><span style="color: #000000; ">; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">!=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                tot</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />                w[tot] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> i;<br />                num[i]</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;<br />            }<br />            t </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />            </span><span style="color: #0000FF; ">while</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">>=</span><span style="color: #000000; "> t)<br />            {<br />                num[i] </span><span style="color: #000000; ">-=</span><span style="color: #000000; "> t;<br />                tot</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />                w[tot] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> i </span><span style="color: #000000; ">*</span><span style="color: #000000; "> t;<br />                t </span><span style="color: #000000; ">*=</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />            }<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                tot</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />                w[tot] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> num[i] </span><span style="color: #000000; ">*</span><span style="color: #000000; "> i;<br />            }<br />        }<br />        memset(dp, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(dp));<br />        </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> tot; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />            </span><span style="color: #0000FF; ">for</span><span style="color: #000000; "> (j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> sum </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">; j </span><span style="color: #000000; ">>=</span><span style="color: #000000; "> w[i]; j</span><span style="color: #000000; ">--</span><span style="color: #000000; ">)<br />            {<br />                dp[j] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> max(dp[j], dp[j </span><span style="color: #000000; ">-</span><span style="color: #000000; "> w[i]] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> w[i]);<br />            }<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (dp[sum </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; "> (sum </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">))<br />            cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">Collection #</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> n</span><span style="color: #000000; ">++</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">:</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">Can be divided.</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br />        </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">Collection #</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> n</span><span style="color: #000000; ">++</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">:</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl </span><span style="color: #000000; "><<</span><span style="color: #000000; "> </span><span style="color: #000000; ">"</span><span style="color: #000000; ">Can't be divided.</span><span style="color: #000000; ">"</span><span style="color: #000000; "> </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br />    }<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />}<br /></span></span></div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/195243.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-15 21:32 <a href="http://www.shnenglu.com/qhpeklh5959/articles/195243.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>POJ1276瑙i鎶ュ憡鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/195232.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Thu, 15 Nov 2012 06:30:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/195232.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/195232.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/195232.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195232.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/195232.html</trackback:ping><description><![CDATA[<span style="font-size: 10pt;"> 榪欓亾棰樼殑棰樼洰鎻忚堪濂芥販涔辯殑璇達紝浣嗘槸璇繪槑鐧戒簡灝辮兘鐪嬪嚭鏉ワ紝瀹為檯涓婅繖閬撻鏄竴涓閲嶈儗鍖咃紝浣嗘槸錛屽氨閭d箞鍐欏閲嶈儗鍖呭繀鐒朵細瓚呮椂錛屾墍浠ュ氨鏈変簡涓涓紭鍖栵紝澶氶噸鑳屽寘浜岃繘鍒舵媶鍒嗕紭鍖栥?/span><br /><span style="font-size: 10pt;">銆婅儗鍖呬節璁層嬩腑浠嬬粛榪囪繖縐嶄紭鍖栵紝浣嗘槸鏄ㄥぉ鐪嬩簡濂戒箙錛屾病鏄庣櫧鍘熺悊錛屾墍浠ユ眰鍔?YY錛屾葷畻鏄簡瑙d簡銆傘?/span><br /><span style="font-size: 10pt;">鎵璋撲簩榪涘埗鎷嗗垎浼樺寲錛屽氨鏄妸n[i]涓墿鍝佺粰鎷嗗垎錛屾瘡涓墿鍝佸崰鐨勭┖闂存槸c[i]錛宑[i]*2錛宑[i]*2</span><sup style="font-size: 10pt;">2</sup><span style="font-size: 10pt;">錛宑[i]*2</span><sup style="font-size: 10pt;">3</sup><span style="font-size: 10pt;">...c[i]*2</span><sup style="font-size: 10pt;">k-1</sup><span style="font-size: 10pt;">錛宑[i]*(n[i]-2</span><sup style="font-size: 10pt;">k</sup><span style="font-size: 10pt;">+1)錛屽疄闄呬笂鍔犲拰浠ュ悗榪樻槸錛坈[i]*n[i]錛夛紝鐗╁搧鐨勪環鍊間篃鏄繖涔堟媶鍒嗭紝涓轟粈涔堣繖涔堟媶鍒嗗憿錛熸濊礬鏉ヨ嚜浜庝簩榪涘埗鏁拌〃紺烘硶錛屾瘮濡傝5</span><sub style="font-size: 10pt;">10</sub><span style="font-size: 10pt;">=101</span><sub style="font-size: 10pt;">2</sub><span style="font-size: 10pt;">錛屼篃灝辨槸璇村鏋滃彇5浠秈鐗╁搧錛岀浉褰撲簬鍙栫涓浠跺拰絎笁浠訛紙2</span><sup style="font-size: 10pt;">0</sup><span style="font-size: 10pt;">+2</span><sup style="font-size: 10pt;">2</sup><span style="font-size: 10pt;">錛夋墍鏈夌殑鏁伴兘鍙互榪欎箞琛ㄧず</span><span style="font-size: 10pt;">鍑烘潵錛?/span><span style="font-size: 10pt;">鎵浠ュ彲浠ヨ榪欎箞鎷嗗垎浜嗕互鍚庡拰鍘熸潵鏄瓑浠風殑錛屾墍浠ヨ繖涔堟媶鍒嗗綋鐒跺氨鏄悎鐞嗙殑銆?/span><br />闄凙C浠g爜錛?br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_143014" onclick="this.style.display='none'; Code_Closed_Text_143014.style.display='none'; Code_Open_Image_143014.style.display='inline'; Code_Open_Text_143014.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_143014" style="display: none" onclick="this.style.display='none'; Code_Open_Text_143014.style.display='none'; Code_Closed_Image_143014.style.display='inline'; Code_Closed_Text_143014.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_143014" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">view code</span><span id="Code_Open_Text_143014" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">iostream</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstdio</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstring</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">using</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">namespace</span><span style="color: #000000; "> std;<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> max(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> a, </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> b)<br />{<br />    </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (a </span><span style="color: #000000; ">></span><span style="color: #000000; "> b) </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> a;<br />    </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> b;<br />}<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> cash, n, cc, c[</span><span style="color: #000000; ">100000</span><span style="color: #000000; ">], num[</span><span style="color: #000000; ">15</span><span style="color: #000000; ">], t, i, j, tot, dp[</span><span style="color: #000000; ">100005</span><span style="color: #000000; ">];<br />    </span><span style="color: #0000FF; ">while</span><span style="color: #000000; "> ((scanf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%d%d</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">cash, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">n)) </span><span style="color: #000000; ">!=</span><span style="color: #000000; "> EOF)<br />    {<br />        tot </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        memset(c, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(c));<br />        </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> n; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        {<br />            cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> num[i] </span><span style="color: #000000; ">>></span><span style="color: #000000; "> cc;<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">!=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                tot</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />                c[tot] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> cc;<br />                num[i]</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;<br />            }<br />            t </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />            </span><span style="color: #0000FF; ">while</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">>=</span><span style="color: #000000; "> t)<br />            {<br />                num[i] </span><span style="color: #000000; ">-=</span><span style="color: #000000; "> t;<br />                tot</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />                c[tot] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> cc </span><span style="color: #000000; ">*</span><span style="color: #000000; "> t;<br />                t </span><span style="color: #000000; ">*=</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />            }<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (num[i] </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                tot</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />                c[tot] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> num[i] </span><span style="color: #000000; ">*</span><span style="color: #000000; "> cc;<br />            }<br />        }<br />        memset(dp, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(dp));<br />        </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> tot; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />            </span><span style="color: #0000FF; ">for</span><span style="color: #000000; "> (j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> cash; j </span><span style="color: #000000; ">>=</span><span style="color: #000000; "> c[i]; j</span><span style="color: #000000; ">--</span><span style="color: #000000; ">)<br />            {<br />                dp[j] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> max(dp[j], dp[j </span><span style="color: #000000; ">-</span><span style="color: #000000; "> c[i]] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> c[i]);<br />            }<br />        cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> dp[cash] </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br />    }<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />}<br /></span></span></div>鐗瑰埆楦h阿錛氶鍝igo<br style="font-size: 10pt;" /><span style="font-size: 10pt;"> </span><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/195232.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-15 14:30 <a href="http://www.shnenglu.com/qhpeklh5959/articles/195232.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>鏈闀垮叕鍏卞瓙搴忓垪闂http://www.shnenglu.com/qhpeklh5959/articles/195200.html嫻呴洦姝?/dc:creator>嫻呴洦姝?/author>Wed, 14 Nov 2012 10:16:00 GMThttp://www.shnenglu.com/qhpeklh5959/articles/195200.htmlhttp://www.shnenglu.com/qhpeklh5959/comments/195200.htmlhttp://www.shnenglu.com/qhpeklh5959/articles/195200.html#Feedback0http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195200.htmlhttp://www.shnenglu.com/qhpeklh5959/services/trackbacks/195200.html緇欏畾涓や釜搴忓垪錛屾眰涓や釜搴忓垪鐨勬渶闀垮叕鍏卞瓙搴忓垪鐨勯暱搴︼紙鏆傛椂鍏堝垪鍑烘潵闀垮害濂戒簡……錛?br />濡傛緇忓吀鐨凞P錛屾垜绔熺劧鐜板湪鎵嶅紕鏄庣櫧錛岀湡蹇冨急鐖嗕簡錛屽ソ鍚э紝搴熻瘽涓嶈浜嗭紝寮濮嬪惂銆?br />瀵逛簬涓や釜搴忓垪錛宒p[i][j]琛ㄧず褰撶涓涓簭鍒楀彇鍓峣涓厓绱狅紝絎簩涓簭鍒楀彇鍓峧涓厓绱犵殑鏃跺欙紝鏈闀垮叕鍏卞瓙搴忓垪鐨勯暱搴︼紝閭d箞瀵逛簬姝ょ姸鎬侊紝鏈夊涓嬪嚑縐嶆帹瀵兼柟寮忥紝鍋囪絎竴涓簭鍒楁槸X錛坸1,x2...xi錛夛紝絎簩涓簭鍒楁槸Y錛坹1,y2...yj錛夛紝濡傛灉xi=yj錛屽垯dp[i][j]=dp[i-1][j-1]+1錛屽惁鍒欙紝灝辯瓑浜巇p[i-1][j]鎴栬卍p[i][j-1]銆傜悊鐢卞涓嬶紝鍋囪X鍜孻鐨勬渶闀垮叕鍏卞瓙搴忓垪涓篫錛坺1,z2,...zk錛夛紝濡傛灉xi=yj錛屽繀鐒舵湁xi=yj=zk錛屽鏋渪i≠yj錛岃屼笖xi≠zk錛屽垯Z蹇呯劧鏄疿i-1鍜孻鐨勪竴涓渶闀垮叕鍏卞瓙搴忓垪錛屽洜涓簒i瀛樺湪涓庡惁鏍規湰涓嶅獎鍝嶆渶緇堢殑緇撴灉錛岃寊k蹇呯劧瀛樺湪浜嶺鐨勫墠i-1涓厓绱犱腑錛屽惁鍒欎笉鎴愮珛錛屽悓鐞嗗彲榪愮敤浜嶻搴忓垪錛屾墍浠ュ彲浠ュ緱鍒版帹瀵煎叧緋匯?br />鍒氬垰鎶婁唬鐮乊Y鍑烘潵錛屼笉鐭ラ亾瀵逛笉瀵癸紝甯屾湜鏌愪竴涓ぇ鐗涘嚭鏉ユ寚姝d竴涓?#8230;…
鐗瑰埆楦h阿錛氱鍝LGG
view code


]]>
POJ1837瑙i鎶ュ憡鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/195173.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Tue, 13 Nov 2012 22:32:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/195173.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/195173.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/195173.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/195173.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/195173.html</trackback:ping><description><![CDATA[<dl><dt>鍒扮幇鍦ㄤ負姝紝榪欓亾棰樻垜榪樻槸娌℃湁瀹屽叏鐞嗚В錛屼絾鏄繕鏄鎶婅繖涓В棰樻姤鍛婃斁鍑烘潵錛岃涓嶅畾鍐欑潃鍐欑潃鎴戝氨鏄庣櫧浜嗭紝璇翠笉瀹氱湅鐫鐪嬬潃錛屾垜涔熷氨鑳芥槑鐧戒簡銆?/dt><dt>棰樻剰鏄粰涓涓乏鍙沖悇闀?5鐨勬潌瀛愶紝鍦ㄦ潌瀛愮殑鎸囧畾浣嶇疆涓婃寕C涓寕閽╋紝緇橤涓牆鐮侊紝涓嶅悓閲嶉噺錛屾寕鍦ㄦ潌瀛愪袱渚э紝闂綍鏃惰揪鍒板鉤琛°?/dt><dt>榪欓亾棰樼殑鐘舵佹垜鎰f槸娌$‘瀹氫簡錛岃榪欓亾棰樺悡鍒頒簡銆傚鉤琛″害錛屽ソ鍚э紝浠庢潵娌″仛榪囩被浼肩殑DP棰樸?/dt><p>榪欓亾棰樼殑鏈緇堢粨鏋滆繕鏄眰鍔╁緱鏉ョ殑錛屽ぉ錛屽張鏄眰鍔?#8230;…鍙眰鍋氫竴閬撲細涓閬撳惂銆?/p><p>鐘舵乨p[i][j]琛ㄧず褰撶敤浜嗗墠i涓墿鍝侊紝騫寵 搴︿負j鐨勬寕娉曠殑鏁伴噺錛岄閲岄潰瑕佹眰鐨勫簲璇ユ槸姹傛墍鏈塯涓墿鍝佹寕涓婂幓浠ュ悗錛屽鉤琛″害涓?鐨勬寕娉曞惂錛屽ソ鍚э紝鏆傛椂鍏堜笉綆″畠錛屾瀬绔儏鍐靛氨鏄墍鏈夌殑鐗╁搧閮芥寕鍦ㄦ渶榪滅錛岄偅鏋佺鎯呭喌灝卞簲璇ユ槸25*20*15=7500錛屾寜鐓ч鎰忥紝搴旇灝辨槸宸﹁竟7500錛屽彸杈?500錛岃寖鍥村簲璇ユ槸[-7500..7500]錛岀Щ妞嶅埌C璇█閲岄潰灝辨槸[1..15000]錛屾墍姹傜殑灝辨槸dp[g][7500]銆?/p><p>濡傛灉絎琲涓墿鍝佹寕鍦ㄦ煇涓涓寕閽╀笂錛屼竴瀹氬湪鎸備笂鍓峣-1涓墿鍝佺殑鎵浜х敓鐨勬煇騫寵 搴︾殑鍩虹涓婁駭鐢熶簡涓涓柊鐨勫鉤琛″害錛屼笉鍚岀殑鎸傞挬騫寵 搴︿笉鍚岋紝絎琲涓墿鍝佹寕鍦ㄦ瘡涓涓寕閽╀笂闈㈡墍浜х敓鐨勬柊騫寵 搴︾殑鎸傛硶閮借鍔犱笂鍓峣-1涓墿鍝佹墍浜х敓鐨勬棫騫寵 搴︾殑鎸傛硶錛屾柟紼嬫湁鐐瑰効楹葷儲錛屽厛涓嶅垪浜嗭紝鏀懼湪涓嬮潰鐨勪唬鐮佷腑濂戒簡……</p><p>鐗瑰埆楦h阿錛氱繑鍝zxyyx_1<br /></p></dl><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_063152" onclick="this.style.display='none'; Code_Closed_Text_063152.style.display='none'; Code_Open_Image_063152.style.display='inline'; Code_Open_Text_063152.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_063152" style="display: none" onclick="this.style.display='none'; Code_Open_Text_063152.style.display='none'; Code_Closed_Image_063152.style.display='inline'; Code_Closed_Text_063152.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_063152" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">view code</span><span id="Code_Open_Text_063152" style="display: none"><br /><!--<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: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">iostream</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #008080; "> 2</span> <span style="color: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstdio</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #008080; "> 3</span> <span style="color: #000000; "></span><span style="color: #0000FF; ">using</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">namespace</span><span style="color: #000000; "> std;<br /></span><span style="color: #008080; "> 4</span> <span style="color: #000000; "></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br /></span><span style="color: #008080; "> 5</span> <span style="color: #000000; ">{<br /></span><span style="color: #008080; "> 6</span> <span style="color: #000000; ">    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> c, g, w[</span><span style="color: #000000; ">21</span><span style="color: #000000; ">], z[</span><span style="color: #000000; ">21</span><span style="color: #000000; ">], i, j, dp[</span><span style="color: #000000; ">21</span><span style="color: #000000; ">][</span><span style="color: #000000; ">15005</span><span style="color: #000000; ">], k;<br /></span><span style="color: #008080; "> 7</span> <span style="color: #000000; ">    cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> c </span><span style="color: #000000; ">>></span><span style="color: #000000; "> g;<br /></span><span style="color: #008080; "> 8</span> <span style="color: #000000; ">    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> c; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">) cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> z[i];<br /></span><span style="color: #008080; "> 9</span> <span style="color: #000000; ">    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> g; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">) cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> w[i];<br /></span><span style="color: #008080; ">10</span> <span style="color: #000000; ">    dp[</span><span style="color: #000000; ">0</span><span style="color: #000000; ">][</span><span style="color: #000000; ">7500</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; ">;<br /></span><span style="color: #008080; ">11</span> <span style="color: #000000; ">    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> g; i</span><span style="color: #000000; ">++</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; ">for</span><span style="color: #000000; "> (j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">-</span><span style="color: #000000; ">7500</span><span style="color: #000000; ">; j </span><span style="color: #000000; "><=</span><span style="color: #000000; "> </span><span style="color: #000000; ">7500</span><span style="color: #000000; ">; j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br /></span><span style="color: #008080; ">14</span> <span style="color: #000000; ">        {<br /></span><span style="color: #008080; ">15</span> <span style="color: #000000; ">            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(dp[i </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">][j </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">7500</span><span style="color: #000000; ">] </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; ">16</span> <span style="color: #000000; ">            </span><span style="color: #0000FF; ">for</span><span style="color: #000000; "> (k </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">; k </span><span style="color: #000000; "><=</span><span style="color: #000000; "> c; k</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br /></span><span style="color: #008080; ">17</span> <span style="color: #000000; ">            {<br /></span><span style="color: #008080; ">18</span> <span style="color: #000000; ">                dp[i][j </span><span style="color: #000000; ">+</span><span style="color: #000000; "> z[k] </span><span style="color: #000000; ">*</span><span style="color: #000000; "> w[i] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">7500</span><span style="color: #000000; ">] </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> dp[i </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">][j </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">7500</span><span style="color: #000000; ">];<br /></span><span style="color: #008080; ">19</span> <span style="color: #000000; ">            }<br /></span><span style="color: #008080; ">20</span> <span style="color: #000000; ">        }<br /></span><span style="color: #008080; ">21</span> <span style="color: #000000; ">    }<br /></span><span style="color: #008080; ">22</span> <span style="color: #000000; ">    cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> dp[g][</span><span style="color: #000000; ">7500</span><span style="color: #000000; ">] </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br /></span><span style="color: #008080; ">23</span> <span style="color: #000000; ">    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">24</span> <span style="color: #000000; ">}<br /></span><span style="color: #008080; ">25</span> <span style="color: #000000; "></span></span></div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/195173.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-14 06:32 <a href="http://www.shnenglu.com/qhpeklh5959/articles/195173.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>HDU1421瑙i鎶ュ憡鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/194989.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Fri, 09 Nov 2012 12:25:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/194989.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/194989.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/194989.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/194989.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/194989.html</trackback:ping><description><![CDATA[<div><div> <p>榪欓亾棰樻垜鐪熷績涓嶄細浜?#8230;…</p><p>棰樻剰鐨勮瘽鎸夐鏌ヨ濂戒簡錛屾垜灝辮鎴戞眰鍔╁姞涓奩Y鐨勮В棰樺ソ浜?#8230;…</p><p>褰撶劧錛岀湅浜嗛偅涓籂緇撶殑棰樻剰鎴戞灉鏂殑灝辮铏愬埌浜嗭紝棰濆晩錛岀棰樺晩……緇欒藩……</p><p>棣栧厛錛屾棦鐒剁柌鍔沖害鏄仛宸紝閭f帓涓簭濂戒簡錛屾湁搴忕姸鎬佷笅鐩擱偦涓や釜鍋氬樊鏄敖閲忓皬鐨勩?/p><p>鐘?鎬佹槸dp[i][j]琛ㄧず鍦ㄥ墠i涓墿鍝佷腑鎵懼嚭j瀵逛嬌寰楃柌鍔沖害鏈灝忥紝鏈変竴涓喅絳栧氨鏄i涓墿鍝佺敤榪樻槸涓嶇敤錛屽鏋滀笉鐢ㄧ殑璇濓紝鍓峣涓墿鍝佺殑鐤插姵搴︿竴瀹氭槸絳変簬鍓?i-1涓墿鍝佹壘鍑簀瀵圭殑鐤插姵搴︼紝濡傛灉鐢ㄤ簡錛岄偅鐢ㄧ殑涓瀹氭槸絎琲涓拰絎琲-1涓紝閭e氨搴旇絳変簬鍓峣-2涓墿鍝佷腑鎵懼嚭j-1瀵圭殑鏈灝忕柌鍔沖害鍔犱笂榪欎袱涓墿鍝佽幏寰楃殑 鐤插姵搴︺傜姸鎬佽漿縐繪柟紼嬶細dp[i][i]=min(dp[i-1][j],dp[i-2][j-1]+(w[i]-w[i-1])^2)銆傜劧鍚庡氨鍐欎唬鐮佸ソ 浜?#8230;…</p> </div></div>鐗瑰埆楦h阿錛氬瓱鍝ilver__bullet<br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_202437" onclick="this.style.display='none'; Code_Closed_Text_202437.style.display='none'; Code_Open_Image_202437.style.display='inline'; Code_Open_Text_202437.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_202437" style="display: none" onclick="this.style.display='none'; Code_Open_Text_202437.style.display='none'; Code_Closed_Image_202437.style.display='inline'; Code_Closed_Text_202437.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_202437" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">view code</span><span id="Code_Open_Text_202437" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">iostream</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">algorithm</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstdio</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">#define</span><span style="color: #000000; "> min(a,b) ((a) < (b) ? (a) : (b))</span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">using</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">namespace</span><span style="color: #000000; "> std;<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> n, k, i, j, w[</span><span style="color: #000000; ">2005</span><span style="color: #000000; ">], dp[</span><span style="color: #000000; ">2005</span><span style="color: #000000; ">][</span><span style="color: #000000; ">1005</span><span style="color: #000000; ">];<br />    cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> n </span><span style="color: #000000; ">>></span><span style="color: #000000; "> k;<br />    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> n; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">) scanf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%ld</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">w[i]);<br />    sort(w </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">, w </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; "> n);<br />    </span><span style="color: #0000FF; ">for</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: #0000FF; ">for</span><span style="color: #000000; "> (j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; j </span><span style="color: #000000; "><=</span><span style="color: #000000; "> k; j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">) dp[i][j] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">210000000</span><span style="color: #000000; ">;<br />    </span><span style="color: #0000FF; ">for</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; ">) dp[i][</span><span style="color: #000000; ">0</span><span style="color: #000000; ">] </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: #0000FF; ">for</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; ">; 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: #0000FF; ">for</span><span style="color: #000000; "> (j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">; j </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; ">2</span><span style="color: #000000; ">); j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />            dp[i][j] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> min(dp[i </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">][j], dp[i </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">][j </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; "> (w[i] </span><span style="color: #000000; ">-</span><span style="color: #000000; "> w[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; "> (w[i] </span><span style="color: #000000; ">-</span><span style="color: #000000; "> w[i </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">]));<br />    cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> dp[n][k] </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />}<br /></span></span></div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/194989.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-09 20:25 <a href="http://www.shnenglu.com/qhpeklh5959/articles/194989.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>璇句笟鎬葷粨鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/194950.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Thu, 08 Nov 2012 17:16:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/194950.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/194950.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/194950.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/194950.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/194950.html</trackback:ping><description><![CDATA[<div><div><div><p style="text-indent:0.74cm;margin-bottom:0.0cm">鐢佃剳姝e湪鍗囩駭緋葷粺錛屾垜涓婃潵紼嶇◢婧滆揪婧滆揪銆?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm">浠婂ぉ鎵劇鍝ョ粰鎴戣浜嗚鍔ㄦ佽鍒掞紝鐪熷績鍙楃泭錛屼負浜嗛槻姝互鍚庡繕浜嗭紝鎬葷粨涓涓嬪厛銆?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm">紓婂摜鏄粠瀵繪壘涓涓湁鍚戞棤鐜浘鐨勬渶鐭礬璁茶搗鐨勶紝鏈夊悜鏃犵幆鍥劇殑璁叉硶鍙傜湅銆婄畻娉曞璁恒嬶紝鍦ㄨ繖閲屾垜灝變笉閲嶅璇翠竴閬嶄簡錛屽洜涓烘垜瀹炲湪鏄病鏈夊姙娉曟妸鍥劇敾鍑烘潵銆?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm">瀹為檯涓婄鍝ヨВ鍐充簡鎴戠殑涓涓枒鎯戯紝鍒╃敤浠栫殑緇忛獙銆?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm">鍋?鍔ㄦ佽鍒掗瀵規垜鏉ヨ鏈涓洪椆蹇冪殑灝辨槸瀵繪壘鐘舵侊紝瀵繪壘鏈浼樺瓙緇撴瀯錛岃矊浼艱繖涓や釜涓鏈夊洶闅懼姩鎬佽鍒掔殑棰樻牴鏈氨娌℃硶鍋氫簡銆傜鍝ュ憡璇夋垜鐨勫仛娉曞氨鏄灇涓劇姸鎬侊紝鎵璋撴灇涓劇姸 鎬佸氨鏄妸榪欓亾棰樻墍鏈夊彲鑳藉綋鐘舵佺殑涓滆タ閮藉垪鍑烘潵錛岀劧鍚庝竴涓釜鍘昏繘琛屾帓闄ゃ傛帓闄ょ殑榪囩▼鏄繖鏍風殑錛岄鍏堣榪涜瀹氫箟錛屼篃灝辨槸璇磋鏄庣‘榪欎釜鐘舵佸埌搴曟槸浠涔堬紝鏈変粈涔堢敤 澶勶紝鐒跺悗鍐嶇敤榪欎釜鐘舵佺敾鏈夊悜鏃犵幆鍥撅紝濡傛灉鐢繪湁鍚戞棤鐜浘鐨勮繃紼嬩腑鎺ㄧ悊鍑虹敱榪欎釜鐘舵侊紝鍚庨潰鐨勬牴鏈棤娉曞疄鐜版垨鑰呰鍑虹幇浜嗙煕鐩撅紝閭d箞榪欎釜鐘舵佸氨鏄敊鐨勶紝鏈緇堜竴瀹氳兘 澶熸灇涓懼嚭鏉ヤ竴涓紜殑鐘舵併?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm"> <span style="font-family:DejaVu Serif , serif"><span style="font-size:medium">/*</span></span>涓璇村埌鏋氫婦錛屽氨瑕佽冭檻涓涓嬫椂闂村鏉傚害錛屼絾鏄垜璁や負榪欎釜鍙互蹇界暐涓嶈錛屽氨綆楁槸瀵逛簬浜鴻剳鏉ヨ錛屽洜涓轟竴閬撻涔嬩腑璨屼技鑳芥壘鍑烘潵鐨勭姸鎬佸簲璇ヤ笉鑳借秴榪囨墜鎸囪兘鏌ユ壘鐨勮寖鍥淬傚ソ鍚э紝浠ヤ笂鏄粎渚涘ū涔愮殑棰樺璇濄?span style="font-family:DejaVu Serif , serif"><span style="font-size:medium">*/</span></span></p><p style="text-indent:0.74cm;margin-bottom:0.0cm">鏋?涓懼嚭鏉ヤ竴涓紜殑鐘舵佷箣鍚庯紝閭d箞灝辮榪涘叆涓嬩竴涓籂緇撶殑鐘舵侊紝閭e氨鏄鎵炬渶浼樺瓙緇撴瀯錛岀鍝ョ殑鍋氭硶鎴戣涓洪潪甯擱珮鏄庯紝閭e氨鏄垜鍓嶆枃鎵鎻愬埌鐨勬湁鍚戞棤鐜浘錛屼互鐘舵佸綋 緇撶偣錛岃漿鍖栧叧緋誨綋浣滆竟鏉冿紝鐢繪湁鍚戞棤鐜浘錛岀劧鍚庡弬鐓х潃鏈夊悜鏃犵幆鍥劇殑閭g鏂瑰紡鏉ュ鎵炬渶浼樺瓙緇撴瀯錛屼絾鏄籂緇撶殑灝辨槸鎬庝箞鍋氳竟鏉冿紝榪欎釜紜疄闂瑰績錛岃繖鍧楃‖楠ㄥご鍙兘鏄竴 鐐圭偣鍘誨晝浜嗐?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm">鏈浼樺瓙緇撴瀯鎺ㄥ嚭鏉ヤ互鍚庯紝涓嬩竴姝ュ氨鏄帹鐘舵佽漿縐繪柟紼嬶紝榪欎釜娌℃湁鍒殑鍔炴硶錛屽氨鏄敤鏈浼樺瓙緇撴瀯涓墍浣撶幇鐨勮漿鍖栧叧緋繪潵鎺ㄧ姸鎬佽漿縐繪柟紼嬩簡……</p><p style="text-indent:0.74cm;margin-bottom:0.0cm">浠ヤ笂榪欎簺鏄鍝ョ粰鎴戣鐨勪笢瑗跨殑鎬葷粨鐗堬紝鐩祴鍥炲繂璧鋒潵搴旇鏄叏鐨勶紝鐒跺悗鎸夌収紓婂摜鐨勬寚浠わ紙涔熸槸鎵ц椋炲摜璇寸殑榪欎釜鏈堝紑濮嬫帹鍔ㄦ佽鍒掔殑璁″垝錛夛紝搴旇緇х畫瀵繪眰鍔ㄦ佽鍒掑叆闂紝紓婂摜鐨勬剰鎬濇槸鍋氫竴鍫嗘按棰樼粌緇冩濇兂錛岄偅涔堝氨鍋氬惂……鐒跺悗灝卞簲璇ョ櫨搴︿竴涓?span style="font-family:DejaVu Serif , serif"><span style="font-size:medium">DP</span></span>姘撮錛屽紑濮嬪埛錛屽埛涓孌墊椂闂存按棰樺惂錛屾庝箞璇村憿錛岀粌緇冩濇兂錛屽厛鍏ヤ簡鍔ㄦ佽鍒掔殑闂紝楂樼駭鍔ㄦ佽鍒掓湁鎴戝晝鐨勫憿錛?/p><p style="text-indent:0.74cm;margin-bottom:0.0cm">椋炲摜緇欐垜瀹氱殑璁″垝搴旇鏄弗鏍兼墽琛岀殑錛岀劧鍚庢垜鑷繁瀹氱殑閭d釜姣旇緝灞卞鐨勫涔犺鍒掍篃搴旇鎵ц涓嬪幓錛屾瘯绔熸暟鎹粨鏋勪篃鏄釜浼わ紝鏈鏈熷ソ姝硅鎶婃暟鎹粨鏋勫熀紜鎷夸笅浜嗭紝鍔ㄦ佽鍒掑叆闂ㄤ簡……</p></div></div> </div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/194950.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-09 01:16 <a href="http://www.shnenglu.com/qhpeklh5959/articles/194950.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>HDOJ1069棰樿В鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/194949.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Thu, 08 Nov 2012 17:14:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/194949.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/194949.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/194949.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/194949.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/194949.html</trackback:ping><description><![CDATA[<div><div><p>鎴戞壙璁わ紝榪欓亾棰樻垜鍋氫簡寰堜箙錛屽ぇ姒傛槸涓夊ぉ鍚?#8230;…鎵浠ュ簲璇ユ妸榪欓亾棰樼瓟妗堟斁鍑烘潵……</p><p>鍟冨姩鎬佽鍒掑槢錛岄偅鑲畾灝辨槸鍔ㄦ佽鍒掑暒錛?/p><p>棰樼洰澶ф剰鏄湁N縐嶆湪鍧楋紝姣忕鏃犻檺涓紝鏈夐暱瀹介珮錛屼換鎰忎袱涓綋搴曪紝涓涓綋楂橈紝鎶婅繖浜涙湪鍧楁憺璧鋒潵錛屼笂闈㈢殑鏈ㄥ潡闀垮拰瀹介兘蹇呴』姣斾笅闈㈢殑灝忥紝闂渶楂樿兘鎽炲楂橈紵</p><p>濂?鍚э紝榪欓亾棰樺垰寮濮嬬湅鍒扮殑鏃跺欐垜鏋滄柇鐪嬫垚浜嗕竴涓棤闄愮┖闂寸殑鑳屽寘闂錛屼絾鏄┈涓婃垜灝卞彂鐜頒簡bug錛屽鏋滅湡鐨勬槸褰撹儗鍖呭仛錛岀浜岄噸寰幆鎬庝箞鍐欏晩……鐒跺悗寮濮嬫灇涓劇 浜屼釜鐘舵?#8230;…f[i]琛ㄧず褰撶i涓湪鍧椾負欏舵椂鐨勬渶楂橀珮搴︼紝姣忎竴涓湪鍧楅兘寰楁瘮瀹冧笅闈㈢殑鏈ㄥ潡灝忥紝浠斾粩緇嗙粏鎯蟲兂灝辮兘鍙戠幇涓涓湪鍧楀彧鑳界敤涓変釜錛岄偅涔堝ソ鍚э紝瀛樺偍鐨勬椂 鍊欎竴涓綋鎴愪笁涓瓨濂戒簡……</p><p>閬囧埌榪欑鎯呭喌鎴戝枩嬈㈢敤緇撴瀯浣擄紝鍥犱負榪欐牱涓涓彉閲忓氨鍙互瀛樺叆涓涓湪鍧楃殑鎵鏈夌殑鍙傛暟錛屾灉鏂氨鏄粍鍚堟暟錛岄暱瀹介珮灝遍偅涔堝瓨 灝辮浜嗭紝鑰屼笖闀挎案榪滄瘮瀹介暱錛屼負浜嗕繚闄╋紝浠ユ墍鏈夋湪鍧楃殑闀夸負涓昏繘琛屾帓搴忋傜劧鍚庡紑濮嬪仛錛岀i涓湪鍧椾負欏訛紝鐒跺悗寮濮嬫壂瀹冨簳涓嬬殑鏈ㄥ潡錛屽洜涓轟簨鍏堟帓榪囧簭浜嗭紝鍦╥涓嬮潰鐨?鏈ㄥ潡鍙兘鏄痠涔嬪墠鐨勮屼笖瀹芥瘮i灝忕殑鏈ㄥ潡錛堝疄闄呬笂錛屾効鎰忔壂鍏ㄥ満涔熻錛夈?/p><p>鏈浼樺瓙緇撴瀯鏄綋絎琲涓負欏朵負鏈楂樼殑鏃跺欙紝i鐨勪笅闈竴瀹氬瓨鍦ㄤ竴鐐筴錛屽綋絎?k涓湪鍧楀湪鏈欏朵笂鐨勬椂鍊欙紝浣垮緱楂樺害鏈楂橈紝鐒跺悗浠涓烘渶搴曪紝褰撶i涓湪鍧楀湪鏈欏朵笂鐨勬椂鍊欙紝浣垮緱楂樺害鏈楂橈紝榪欐牱涓鏉ユ暣浣撻珮搴︽渶楂樸傝瀹炶瘽錛屾垜鎯寵繃褰撴憺浜嗗墠i涓?鏈ㄥ潡錛屼嬌寰楅珮搴︽渶楂樼殑瀛愮粨鏋勶紝緇撴灉鎴戝氨鍙戠幇浜嗘瘡涓湪鍧楅兘鏈変笁縐嶆憜鏀炬柟寮忥紝鐒跺悗灝辨槸涓涓ぇbug——鏍規湰鏃犳硶瀹炵幇濂戒笉濂?#8230;…</p><p>鏈浼樺瓙緇撴瀯鎵懼埌浜嗭紝鐒跺悗灝辨槸鍐欐柟紼嬩簡鍝?/p><p>鏂圭▼閭f鐨勪唬鐮侊細</p><p>if (f[i] < f[j] + a[i].g) f[i] = f[j] + a[i].g;</p><p>a[i].g鏄i涓殑楂橈紝j琛ㄧず鐨勬槸i涓嬮潰鐨勯偅涓紝姣忎竴姝ラ兘瑕佹湁涓涓垵濮嬪寲錛屽氨鏄痜[i] = a[i].g銆?/p><p>濂戒簡……鍐欏畬浜嗐?/p><p>PS錛氬叾瀹炶繖涓伒鎰熸潵鑷簬紓婂摜鐨勪竴涓寚瀵?#8230;…鍘熺増鏄痜[i, s]琛ㄧず褰撶i涓互s鏂瑰紡涓洪《鐨勬椂鍊欙紝鏈楂樼殑楂樺害錛岀劧鍚庢垜瑙夊緱鏈ㄥ潡鐨勫彉鍖栨湁鐐歸珮娣憋紝灝卞共鑴嗘妸涓涓湪鍧楀綋鎴愪笁涓湪鍧椾簡銆傘傘?/p><p>鐗瑰埆楦h阿錛氱鍝LGG<br /></p></div></div><br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000;"></span><div>#include <iostream><br />#include <cstdio><br />#include <cstring><br />#include <cmath><br />#include <algorithm><br />using namespace std;<br />struct data<br />{<br />    int x, y, z;<br />}a[100];<br />int n, i, j, tot, x, y, z, dp[100];<br />int max(int a, int b)<br />{<br />    if (a > b) return a;<br />    else return b;<br />}<br />int min(int a, int b)<br />{<br />    if (a < b) return a;<br />    else return b;<br />}<br />int cmp(data a, data b)<br />{<br />    return a.x > b.x;<br />}<br />void add(int x, int y, int z)<br />{<br />    tot++;<br />    a[tot].x = max(x, y);<br />    a[tot].y = min(x, y);<br />    a[tot].z = z;<br />    tot++;<br />    a[tot].x = max(x, z);<br />    a[tot].y = min(x, z);<br />    a[tot].z = y;<br />    tot++;<br />    a[tot].x = max(y, z);<br />    a[tot].y = min(y, z);<br />    a[tot].z = x;<br />}<br />int main()<br />{<br />    int t = 1;<br />    while (cin >> n && n != 0)<br />    {<br />        tot = 0;<br />        memset(dp, 0, sizeof(dp));<br />        for (i = 1; i <= n; i++)<br />        {<br />            cin >> x >> y >> z;<br />            add(x, y, z);<br />        }<br />        sort(a + 1, a + tot + 1, cmp);<br />        for (i = 1; i <= tot; i++) dp[i] = a[i].z;<br />        for (i = 2; i <= tot; i++)<br />          for (j = 1; j <= i; j++)<br />          {<br />              if (a[j].x > a[i].x && a[j].y > a[i].y)<br />              {<br />                  dp[i] = max(dp[i], dp[j] + a[i].z);<br />              }<br />          }<br />        int max = 0;<br />        for (i = 1; i <= tot; i++)<br />          if (dp[i] > max) max = dp[i];<br />        cout << "Case " << t++ << ": maximum height = " << max << endl;<br />    }<br />    return 0;<br />}</div><span style="color: #000000; "></span></div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/194949.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-09 01:14 <a href="http://www.shnenglu.com/qhpeklh5959/articles/194949.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>POJ3616瑙i鎶ュ憡鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/194948.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Thu, 08 Nov 2012 17:11:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/194948.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/194948.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/194948.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/194948.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/194948.html</trackback:ping><description><![CDATA[<div> <p>棰?#8230;…榪欓亾棰樿矊浼間篃涓嶆庝箞寮哄ぇ錛屼絾鏄潃瀹炶鎴戠籂緇擄紝鎵浠ユ垜鍙堝紑濮嬫眰鍔╀簡錛岀劧鍚庢眰鍔╂垚鍔燂紝瑙i錛岀劧鍚庤創涓婃潵錛屼互鍏嶄互鍚庡繕璁?#8230;…</p><p>棰樼洰澶ф剰鏄繖鏍風殑錛岀粰涓孌墊椂闂碞錛岀粰M涓椂闂存錛岀粰寮濮嬫椂闂村拰緇撴潫鏃墮棿錛屾瘡涓椂闂存鏈変竴涓晥鐜囷紝姣忔鐢ㄥ畬鏌愪竴鏃墮棿孌電殑鏁堢巼蹇呴』浼戞伅R灝忔椂錛屾眰鏈楂樼殑鏁堢巼銆?/p><p>濂藉惂錛屽瓨鍌ㄧ粨鏋勬病鏈夊紓璁紝涓涓噺錛屼笁涓弬鏁幫紝鏋滄柇鐨勭粨鏋勪綋瀛樺偍鍟婏紝鏂逛究寰椾綋錛屽濂藉晩……</p><p>鍒?寮濮嬫垜鏋滄柇鐨勬墦綆楁妸瀹冨綋鎴愪竴涓?1鑳屽寘鏉ュ仛錛屼絾鏄灉鏂殑閿欎簡錛岃鎴戣嚜宸卞惁鍐充簡錛堣繕濂芥病鍐?#8230;…錛夋垜鐨勬兂娉曟槸鐩存帴鎶婃瘡涓孌電殑緇撴潫鏃墮棿鍑忓幓寮濮嬫椂闂達紝鐒跺悗鎴愪負涓涓秷鑰楁椂闂存錛岀劧鍚庢娊璞?#8230;…N浠h〃鑳屽寘鎬誨閲忥紝M浠h〃鐗╁搧涓暟錛屾秷鑰楁椂闂存浠h〃鐫鐗╁搧鍗犵敤鐨勭┖闂達紝鏁堢巼灝辨槸鐗╁搧浠峰鹼紝涓涓崕涓戒附鐨?1鑳屽寘瑙e喅……褰撶劧榪?涓敊浜嗭紝鍘熷洜鏄棦鐒剁粰浜嗘瘡涓椂闂存鐨勫紑濮嬫椂闂村拰緇撴潫鏃墮棿錛岃繕鏈変紤鎭椂闂達紝閭e鏋滈噸鍙犱簡鎬庝箞綆?#8230;…鐒跺悗灝辨灉鏂殑鍚﹀喅浜嗐?/p><p>瀹為檯涓婃紜殑鐘舵佹槸褰?閫夌敤絎琲涓椂闂存涓虹粨灝劇殑鏃跺欙紝鎵鑾峰緱鐨勬渶澶ф晥鐜囷紝褰撶劧寰楁妸鏃墮棿孌電殑鍏堝悗鍏堟帓涓簭錛屾寜鐓у紑濮嬫椂鍒繪帓搴忥紝榪欐牱姣旇緝鏈夌埍……榪欐牱鐨勮瘽褰撳鐞嗙i涓椂闂存涔熷氨鏄?f[i]鐨勬椂鍊欙紝涔嬪墠闇瑕佽綆楃殑閮藉湪絎琲孌電殑鍓嶉潰銆傚綋澶勭悊鍒扮i孌電殑鏃跺欙紝鍓嶉潰蹇呯劧鏈変竴涓猨錛屼嬌寰椾互j涓虹粨灝劇殑鏃跺欙紝鎵寰楁晥鐜囨渶澶э紝浠庤屼繚璇佸埌絎琷孌電殑鏈 澶ф晥鐜囧姞涓婄i孌電殑鏁堢巼鏈澶э紝j鍙互鏄痠鍓嶉潰鐨勪換鎰忎竴孌墊椂闂達紝鍙嶆淇濊瘉浜嗘渶澶у氨琛屻傚垵濮嬪寲鐨勬椂鍊欒鏈夎繖涔堜竴鍙ワ細f[i]=in[i].ef錛岃繖鏍峰氨鏄槻姝?鏈夊墠闈㈡墍鏈夋鍏ㄩ兘涓嶇敤榪欑鎯呭喌銆傛柟紼嬫槸榪欐牱鐨勶細f[i]=max(f[j]+in[i].ef錛宖[i])錛宨n[i].ef鏄i孌墊椂闂翠腑鐨勬晥鐜囥?/p><p>浣嗘槸涓瀹氳娉ㄦ剰涓鐐癸紝閫夌敤鐨勬椂闂村尯闂撮櫎浜嗙鐐逛互澶栨槸涓嶈兘閲嶅悎鐨勶紝榪樺緱璁板緱鎶婁紤鎭椂闂村姞涓?#8230;…</p><p>鐗瑰埆楦h阿錛氱繑鍝zxyyx_1<br /></p><div style="background-color: #eeeeee; font-size: 13px; border: 1px solid #cccccc; padding: 4px 5px 4px 4px; width: 98%; word-break: break-all;"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">iostream</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">cstdio</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">algorithm</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">using</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">namespace</span><span style="color: #000000; "> std;<br /></span><span style="color: #0000FF; ">struct</span><span style="color: #000000; "> interval<br />{<br />    </span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> st, en, ef;<br />}</span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[</span><span style="color: #000000; ">1001</span><span style="color: #000000; ">];<br /></span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> max(</span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> a, </span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> b)<br />{<br />    </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (a </span><span style="color: #000000; ">></span><span style="color: #000000; "> b) </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> a;<br />    </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> b;<br />}<br /></span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> cmp(interval a, interval b)<br />{<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> a.st </span><span style="color: #000000; "><</span><span style="color: #000000; "> b.st;<br />}<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">long</span><span style="color: #000000; "> n, m, r, i, j, f[</span><span style="color: #000000; ">1001</span><span style="color: #000000; ">], maxi;<br />    cin </span><span style="color: #000000; ">>></span><span style="color: #000000; "> n </span><span style="color: #000000; ">>></span><span style="color: #000000; "> m </span><span style="color: #000000; ">>></span><span style="color: #000000; "> r;<br />    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> m; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />    {<br />        scanf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%ld%ld%ld</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, </span><span style="color: #000000; ">&</span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[i].st, </span><span style="color: #000000; ">&</span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[i].en, </span><span style="color: #000000; ">&</span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[i].ef);<br />    }<br />    sort(</span><span style="color: #0000FF; ">in</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: #0000FF; ">in</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; ">+</span><span style="color: #000000; "> m, cmp);<br />    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> m; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">) f[i] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[i].ef;<br />    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> m; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        </span><span style="color: #0000FF; ">for</span><span style="color: #000000; "> (j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">; j </span><span style="color: #000000; "><</span><span style="color: #000000; "> i; j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (</span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[j].en </span><span style="color: #000000; ">+</span><span style="color: #000000; "> r </span><span style="color: #000000; "><=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[i].st)<br />            {<br />                f[i] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> max(f[j] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">in</span><span style="color: #000000; ">[i].ef, f[i]);<br />            }<br />        }<br />    </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> m; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; "> (f[i] </span><span style="color: #000000; ">></span><span style="color: #000000; "> maxi) maxi </span><span style="color: #000000; ">=</span><span style="color: #000000; "> f[i];<br />    cout </span><span style="color: #000000; "><<</span><span style="color: #000000; "> maxi </span><span style="color: #000000; "><<</span><span style="color: #000000; "> endl;<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000;">;<br />}</span></div> </div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/194948.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-09 01:11 <a href="http://www.shnenglu.com/qhpeklh5959/articles/194948.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>POJ1953瑙i鎶ュ憡鈥︹?/title><link>http://www.shnenglu.com/qhpeklh5959/articles/194202.html</link><dc:creator>嫻呴洦姝?/dc:creator><author>嫻呴洦姝?/author><pubDate>Sat, 03 Nov 2012 08:50:00 GMT</pubDate><guid>http://www.shnenglu.com/qhpeklh5959/articles/194202.html</guid><wfw:comment>http://www.shnenglu.com/qhpeklh5959/comments/194202.html</wfw:comment><comments>http://www.shnenglu.com/qhpeklh5959/articles/194202.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/qhpeklh5959/comments/commentRss/194202.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/qhpeklh5959/services/trackbacks/194202.html</trackback:ping><description><![CDATA[<div><div> <div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include </span><span style="color: #000000; "><</span><span style="color: #000000; ">stdio.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> m, n, f[</span><span style="color: #000000; ">46</span><span style="color: #000000; ">][</span><span style="color: #000000; ">2</span><span style="color: #000000; ">], i, t </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />    scanf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%d</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">m);<br />    </span><span style="color: #0000FF; ">while</span><span style="color: #000000; "> (t </span><span style="color: #000000; "><=</span><span style="color: #000000; "> m)<br />    {<br />        scanf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%d</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">n);<br />        f[</span><span style="color: #000000; ">1</span><span style="color: #000000; ">][</span><span style="color: #000000; ">0</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; ">;<br />        f[</span><span style="color: #000000; ">1</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: #000000; ">1</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">for</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; ">; i </span><span style="color: #000000; "><=</span><span style="color: #000000; "> n; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        {<br />            f[i][</span><span style="color: #000000; ">0</span><span style="color: #000000; ">] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> f[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; ">0</span><span style="color: #000000; ">] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> f[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; ">1</span><span style="color: #000000; ">];<br />            f[i][</span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> f[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; ">0</span><span style="color: #000000; ">];<br />        }<br />        printf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">Scenario #%d:\n%d\n\n</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, t</span><span style="color: #000000; ">++</span><span style="color: #000000; ">, f[n][</span><span style="color: #000000; ">0</span><span style="color: #000000; ">] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> f[n][</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]);<br />    }<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />}<br /></span></div><p>濂藉惂錛屾垜鐪熷績鐭ラ亾錛岃繖閬揇P鐪熸槸鍒頒竴瀹氫喚鍎夸笂鐨勬按錛屼絾鏄垜榪樻槸鍐沖畾鎶婂畠璐翠笂鏉ャ?/p><p>棰樼洰澶ф剰鏄敤n涓?鎴栬?緇勬垚涓涓簭鍒楋紝姣忎袱涓?涓嶈兘鐩擱偦錛岄棶鍙堝灝戠緇勬垚鏂規硶銆?/p><p>紼嶇◢鑰冭檻浜嗕竴涓嬶紝鑲畾鏄厛鑰冭檻絎琲涓暟鐨勬椂鍊欐湁鍑犵錛岀i涓暟鍢涳紝涓嶆槸0灝辨槸1錛屼簬鏄箮錛岃冭檻絎琲-1涓暟錛屽鏋滅i涓暟鏀?錛岄偅絎琲-1涓暟鏀句粈涔堥兘鏃犳墍璋擄紝濡傛灉絎琲涓暟鏀?錛岄偅絎琲-1涓暟灝卞彧鑳芥斁0錛岃矊浼艱繖涓姸鎬佽繕鏄潪甯稿ソ紜鐨勬槸鍚?#8230;…</p><p>f[i][0]琛ㄧず絎琲涓暟鏄?鐨勬椂鍊欙紝鏈夊灝戠鏀炬硶</p><p>f[i][1]琛ㄧず絎琲涓暟鏄?鐨勬椂鍊欙紝鏈夊灝戠鏀炬硶</p><p>鏍規嵁鍓嶉潰鐨勬帹瀵鹼紝f[i][0]=f[i-1][0]+f[i-1][1]錛宖[i][1]=f[i-1][0]銆?/p><p>鐒跺悗榪欓亾棰樺氨娌℃湁鐒跺悗浜嗭紝鍙槸涓漢鐨勬槸……鎴戠珶鐒跺洜涓哄皯鎵撲簡涓涓洖杞﹂敊浜嗗ソ鍑犳……鍥?#8230;…orz銆?/p><p>榪欓亾棰樺ソ璞℃槸鑳借瘉鏄庡嚭鏉ユ槸涓枑娉㈤偅鍒囨暟鍒楋紝鏄笉鏄殑鎴戜笉綆′簡錛屽弽姝e綋DP鍋氭槸A浜?#8230;…</p><p>濂藉惂錛岃繖閬撻寰堟按鍏跺疄錛屾垜鎯崇殑涔熶笉鎱紝緇х畫鍏ラ棬鍘誨惂……</p> </div></div><img src ="http://www.shnenglu.com/qhpeklh5959/aggbug/194202.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/qhpeklh5959/" target="_blank">嫻呴洦姝?/a> 2012-11-03 16:50 <a href="http://www.shnenglu.com/qhpeklh5959/articles/194202.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss> <footer> <div class="friendship-link"> <p>感谢您访问我们的网站,您可能还对以下资源感兴趣:</p> <a href="http://www.shnenglu.com/" title="精品视频久久久久">精品视频久久久久</a> <div class="friend-links"> </div> </div> </footer> <a href="http://www.cooyu.cn" target="_blank">久久综合日本熟妇</a>| <a href="http://www.enfb.cn" target="_blank">亚洲午夜无码AV毛片久久</a>| <a href="http://www.pudlv.cn" target="_blank">伊人久久大香线蕉AV一区二区</a>| <a href="http://www.6kun.cn" target="_blank">精品乱码久久久久久久</a>| <a href="http://www.yywhqy.cn" target="_blank">久久久久久国产a免费观看黄色大片 </a>| <a href="http://www.delannahotel.com.cn" target="_blank">久久91精品国产91久久小草</a>| <a href="http://www.seajack.cn" target="_blank">亚洲AV无码久久精品狠狠爱浪潮</a>| <a href="http://www.id19.cn" target="_blank">久久无码AV中文出轨人妻</a>| <a href="http://www.gvsx.cn" target="_blank">久久无码精品一区二区三区</a>| <a href="http://www.deiden.cn" target="_blank">国产午夜精品久久久久九九电影</a>| <a href="http://www.bveuge.cn" target="_blank">91精品国产91久久</a>| <a href="http://www.ecscrm.com.cn" target="_blank">久久国产成人午夜aⅴ影院 </a>| <a href="http://www.domino111.com.cn" target="_blank">久久久久18</a>| <a href="http://www.jzqyc.com.cn" target="_blank">久久久久综合国产欧美一区二区 </a>| <a href="http://www.111net.org.cn" target="_blank">久久久久无码精品</a>| <a href="http://www.sjpeixun.cn" target="_blank">韩国三级中文字幕hd久久精品</a>| <a href="http://www.tianyicpa.com.cn" target="_blank">99久久精品国产毛片</a>| <a href="http://www.liaojiaren.cn" target="_blank">精品无码久久久久久国产</a>| <a href="http://www.pgos.com.cn" target="_blank">久久伊人精品青青草原日本</a>| <a href="http://www.tjjobs.com.cn" target="_blank">最新久久免费视频</a>| <a href="http://www.hotsw.com.cn" target="_blank">久久久噜噜噜久久中文福利</a>| <a href="http://www.oubaidu.cn" target="_blank">老司机国内精品久久久久</a>| <a href="http://www.huiju58.cn" target="_blank">久久成人永久免费播放</a>| <a href="http://www.czyhq.cn" target="_blank">麻豆久久久9性大片</a>| <a href="http://www.unicity642.com.cn" target="_blank">亚洲国产精品无码久久SM </a>| <a href="http://www.chuchu8.cn" target="_blank">国产精品美女久久久</a>| <a href="http://www.231it.cn" target="_blank">国产精品亚洲综合专区片高清久久久 </a>| <a href="http://www.xs258.cn" target="_blank">精品综合久久久久久88小说</a>| <a href="http://www.xmxfz.cn" target="_blank">中文国产成人精品久久亚洲精品AⅤ无码精品</a>| <a href="http://www.xh80.cn" target="_blank">大香伊人久久精品一区二区</a>| <a href="http://www.bainiu168.cn" target="_blank">久久精品中文騷妇女内射</a>| <a href="http://www.xinjian452858.cn" target="_blank">久久91精品国产91久久小草</a>| <a href="http://www.vrfx.cn" target="_blank">亚洲国产小视频精品久久久三级 </a>| <a href="http://www.zhaopf.com.cn" target="_blank">2020最新久久久视精品爱</a>| <a href="http://www.shangxinju.cn" target="_blank">久久久久一本毛久久久</a>| <a href="http://www.shairproperty.cn" target="_blank">久久亚洲精品国产精品</a>| <a href="http://www.tr78.cn" target="_blank">国内精品久久久久国产盗摄</a>| <a href="http://www.myjhy.cn" target="_blank">欧洲精品久久久av无码电影 </a>| <a href="http://www.meelin.cn" target="_blank">久久综合伊人77777</a>| <a href="http://www.hhhkk.cn" target="_blank">国内精品久久久久影院优</a>| <a href="http://www.ks29n.cn" 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>