contest.view.begin
:
1561793400000
[pandaking训练3]-----基础dp
contest.view.end
:
1566977400000
contest.view.elapsed
:
(
contest.frozen
)
contest.view.remaining
:
Status
My Status
PDF
contest.view.statement_selection_label
:
ID
status.list.username
status.list.prob
status.list.result
status.list.time
(ms)
status.list.mem
(MB)
status.list.length
status.list.lang
C
C++
C#
D
Go
Haskell
Java
JavaScript
Kotlin
Lua
Objective-C
Pascal
Perl
PHP
Python
Ruby
Rust
Scala
Swift
Other
status.list.submit_time
{"id":308181,"title":"[pandaking训练3]-----基础dp","type":0,"openness":0,"authStatus":1,"begin":1561793400000,"end":1566977400000,"freezeTime":1566977400000,"unfreezeTime":1566977400000,"enableFreeze":false,"createTime":1561793386000,"version":"a9e","started":true,"ended":true,"managerId":181714,"managerName":"panda_king","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":16215,"title":"记忆化操作的比较深的应用和滚动数组","oj":"HDU","probNum":"1024","num":"A","enabledDescKeys":[316466386062669],"descBriefs":[{"key":316466386062669,"updateDate":"2026-05-08","version":1778227560000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003eJGShining（极光炫影）\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":17497,"title":"状压dp裸题","oj":"HDU","probNum":"1074","num":"B","enabledDescKeys":[316048055396553],"descBriefs":[{"key":316048055396553,"updateDate":"2026-05-08","version":1778232002000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":10482,"title":"加绝对值的01背包问题","oj":"POJ","probNum":"1015","num":"C","enabledDescKeys":[349624436378472],"descBriefs":[{"key":349624436378472,"updateDate":"2019-04-03","version":1554293571000,"author":"0258","authorKey":"user:182289","authorUserId":182289,"type":"user","lang":"zh","langDisplay":"中文","official":false,"mainOfficial":false,"publicVisible":true,"avatarUrl":"https://cn.cravatar.com/avatar/0709c56406bedea172cca667f23a489a?d\u003didenticon","remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"","content":"\u003cspan style\u003d\u0027color:var(--color-danger)\u0027\u003eSpecial judge\u003c/span\u003e","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dSouthwestern+European+Regional+Contest+1996\"\u003eSouthwestern European Regional Contest 1996\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":21379,"title":"记忆化搜索实现区间dp","oj":"POJ","probNum":"3186","num":"D","enabledDescKeys":[315003464358831],"descBriefs":[{"key":315003464358831,"updateDate":"2026-05-26","version":1779782439000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2006+February+Gold+%26+Silver\"\u003eUSACO 2006 February Gold \u0026amp; Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":30428,"title":"某一个点只可能经过一次，那么我们用记忆话搜索来做就行了","oj":"HDU","probNum":"1078","num":"E","enabledDescKeys":[312250521006290],"descBriefs":[{"key":312250521006290,"updateDate":"2026-05-26","version":1779783635000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dZhejiang+University+Training+Contest+2001\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Zhejiang University Training Contest 2001 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":30059,"title":"根据题目给出的信息枚举左下角，dp[i][j]缓存计算","oj":"HDU","probNum":"2859","num":"F","enabledDescKeys":[311841563705286],"descBriefs":[{"key":311841563705286,"updateDate":"2026-05-26","version":1779792594000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"5000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2009+Multi-University+Training+Contest+5+-+Host+by+NUDT\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 5 - Host by NUDT \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":10721,"title":"离散化来减小范围，方便dp，顺便变量维护转移，把一个序列变成非严格单调递增","oj":"POJ","probNum":"3666","num":"G","enabledDescKeys":[312284719459069],"descBriefs":[{"key":312284719459069,"updateDate":"2026-05-26","version":1779795822000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2008+February+Gold\"\u003eUSACO 2008 February Gold\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":33666,"title":"决策集合只增多不减少，用变量维护集合，减小一个量级的时间复杂度，同时注意状态的设定（一个经典问题）","oj":"ZOJ","probNum":"2432","num":"H","enabledDescKeys":[310616799878653],"descBriefs":[{"key":310616799878653,"updateDate":"2025-04-27","version":1745710249000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"2000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"os","content":"Linux","spoiler":false},{"title":"author","content":"ZOJ 出题组","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.remote_oj_unavailable","submitMethods":[false,false,true]},{"pid":177849,"title":"把一个序列变成严格单调递增","oj":"HDU","probNum":"5256","num":"I","enabledDescKeys":[302557222350978],"descBriefs":[{"key":302557222350978,"updateDate":"2025-08-24","version":1756028317000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2015%C4%EA%B0%D9%B6%C8%D6%AE%D0%C7%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B3%F5%C8%FC%282%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2015年百度之星程序设计大赛 - 初赛(2) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":19671,"title":"加法是满足无后效性的，但是乘法对负数不满足，所以我们要用两维度来记录最大值和最小值，然后注意初始化的情况，我们要用把最小值初始化成正无穷， 最大值初始化成负无穷。然后转移分加法和乘法。","oj":"POJ","probNum":"1179","num":"J","enabledDescKeys":[315439928334219],"descBriefs":[{"key":315439928334219,"updateDate":"2025-05-01","version":1746105290000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"10000 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dIOI+1998\"\u003eIOI 1998\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":23652,"title":"区间dp的难点在于转移，这是一个转移比较简单的区间dp","oj":"POJ","probNum":"2955","num":"K","enabledDescKeys":[309980606166168],"descBriefs":[{"key":309980606166168,"updateDate":"2026-02-26","version":1772098111000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dStanford+Local+2004\"\u003eStanford Local 2004\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":31865,"title":"要理解转移的意思和意义","oj":"HDU","probNum":"4283","num":"L","enabledDescKeys":[311212663371663],"descBriefs":[{"key":311212663371663,"updateDate":"2026-05-15","version":1778857133000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2012+ACM%2FICPC+Asia+Regional+Tianjin+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 ACM/ICPC Asia Regional Tianjin Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":13415,"title":"一定要注重转移，得有个合理的转移式子之后才开始写转移方程式","oj":"HDU","probNum":"2476","num":"M","enabledDescKeys":[316299493730625],"descBriefs":[{"key":316299493730625,"updateDate":"2026-04-04","version":1775250596000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"2000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2008+Asia+Regional+Chengdu\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008 Asia Regional Chengdu \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":12637,"title":"状压dp最重要的范围，发现一个很小的范围的话一般都可以状压或者搜索，状压一个最重要的一点是当前状态与怎么到达的无关，其他就简单预处理一下就好了","oj":"POJ","probNum":"2411","num":"N","enabledDescKeys":[312567296724171],"descBriefs":[{"key":312567296724171,"updateDate":"2026-06-30","version":1782778182000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"3000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUlm+Local+2000\"\u003eUlm Local 2000\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":10358,"title":"经典状压dp，把一个集合状态压缩成一个数字","oj":"POJ","probNum":"1185","num":"O","enabledDescKeys":[312348882061427],"descBriefs":[{"key":312348882061427,"updateDate":"2025-05-08","version":1746668243000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"2000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dNoi+01\"\u003eNoi 01\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":17087,"title":"用数据结构维护dp，然后看到这么大的范围肯定一般要想到用数据结构来维护优化","oj":"POJ","probNum":"3171","num":"P","enabledDescKeys":[315637750535047],"descBriefs":[{"key":315637750535047,"updateDate":"2025-04-28","version":1745834712000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"65536 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2005+December+Silver\"\u003eUSACO 2005 December Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":271785,"title":"树状数组维护线段树模板题，决策集合有两个限制条件，有两个坐标，一个是下标位置，一个是数值大小，所以可以转化为偏序问题，从而用树状数组来维护，有时候注意这个i，j的顺序是可以更换的？？？？？？？？？","oj":"HDU","probNum":"5542","num":"Q","enabledDescKeys":[296601481202948],"descBriefs":[{"key":296601481202948,"updateDate":"2025-08-25","version":1756058000000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"4000 ms","spoiler":false},{"title":"mem_limit","content":"65535 kB","spoiler":false},{"title":"os","content":"Windows","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dThe+2015+China+Collegiate+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e The 2015 China Collegiate Programming Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":10478,"title":"单调队列优化模板题","oj":"POJ","probNum":"1821","num":"R","enabledDescKeys":[312297511877380],"descBriefs":[{"key":312297511877380,"updateDate":"2025-11-06","version":1762423794000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"30000 kB","spoiler":false},{"title":"source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dRomania+OI+2002\"\u003eRomania OI 2002\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]}],"problemsHash":"a9e6dfbe43374e819c12a3182ac09057","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"oneShot":false,"customizedWeight":false,"showPeers":false,"participantMode":0,"excludedFromRank":false,"participation":{"enabled":false,"canChange":false,"options":[]},"clonedFromId":0}
