gaoyuan--经典DP

Begin: 1531449000000

End: 1533609000000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 2084	数塔
B	CodeForces 429B	Working out
C	FZU 2234	牧场物语
D	HDU 1003	Max Sum
E	POJ 1050	To the Max
F	HDU 1024	Max Sum Plus Plus
G	POJ 2533	Longest Ordered Subsequence
H	HDU 1257	最少拦截系统
I	HDU 1025	Constructing Roads In JGShining's Kingdom
J	CodeForces 583D	Once Again...
K	HDU 1159	Common Subsequence
L	POJ 2250	Compromise
M	HDU 1503	Advanced Fruits
N	HDU 5282	Senior's String
O	POJ 1651	Multiplication Puzzle
P	HDU 4323	Magic Number
Q	HDU 4271	Find Black Hand
R	HDU 1579	Function Run Fun
S	POJ 1157	LITTLE SHOP OF FLOWERS

Status

My Status

Translate

PDF

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":237921,"title":"gaoyuan--经典DP","type":0,"openness":0,"authStatus":1,"begin":1531449000000,"end":1533609000000,"createTime":1531448661000,"started":true,"ended":true,"managerId":159779,"managerName":"hnustgaoyuan","fav":false,"description":{"format":"PLAIN","content":"HNUST_gaoyuan__DP"},"announcement":"","problems":[{"pid":23620,"title":"数塔","oj":"HDU","probNum":"2084","num":"A","publicDescId":3098947544305651,"publicDescVersion":1714268746000,"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\u003d2006%2F1%2F15+ACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2006/1/15 ACM程序设计期末考试 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":51070,"title":"Working out","oj":"CodeForces","probNum":"429B","num":"B","publicDescId":3189715846077621,"publicDescVersion":1714323911000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/429\"\u003eCodeforces Round 245 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    *1600\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/12254\" title\u003d\"Announcement\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/12265\" title\u003d\"Codeforces Round #245 — Editorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":375674,"title":"牧场物语","oj":"FZU","probNum":"2234","num":"C","publicDescId":3269514704602744,"publicDescVersion":1620386864000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"Source","content":"福州大学第十三届程序设计竞赛 \n      ","spoiler":true}],"weight":1,"submitTips":"FZU is down.","submitMethods":[false,false,false]},{"pid":15514,"title":"Max Sum","oj":"HDU","probNum":"1003","num":"D","publicDescId":3164930999928916,"publicDescVersion":1714239705000,"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":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17323,"title":"To the Max","oj":"POJ","probNum":"1050","num":"E","publicDescId":3151332933177795,"publicDescVersion":1714438932000,"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\u003dGreater+New+York+2001\"\u003eGreater New York 2001\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":16215,"title":"Max Sum Plus Plus","oj":"HDU","probNum":"1024","num":"F","publicDescId":3150575694374935,"publicDescVersion":1714291782000,"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":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":15302,"title":"Longest Ordered Subsequence","oj":"POJ","probNum":"2533","num":"G","publicDescId":3164707879725883,"publicDescVersion":1714240730000,"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\u003dNortheastern+Europe+2002\"\u003eNortheastern Europe 2002\u003c/a\u003e, Far-Eastern Subregion\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":25970,"title":"最少拦截系统","oj":"HDU","probNum":"1257","num":"H","publicDescId":3123535222321891,"publicDescVersion":1714302448000,"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\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙江工业大学第四届大学生程序设计竞赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":18470,"title":"Constructing Roads In JGShining\u0027s Kingdom","oj":"HDU","probNum":"1025","num":"I","publicDescId":3156785245820638,"publicDescVersion":1714291842000,"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":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":253418,"title":"Once Again...","oj":"CodeForces","probNum":"583D","num":"J","publicDescId":3247540371487080,"publicDescVersion":1714122795000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/583\"\u003eCodeforces Round 323 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    constructive algorithms\r\n\n\r\n    dp\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/20692\" title\u003d\"Codeforces Round #323 Editorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":22149,"title":"Common Subsequence","oj":"HDU","probNum":"1159","num":"K","publicDescId":3112714947495382,"publicDescVersion":1714374712000,"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\u003dSoutheastern+Europe+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Southeastern Europe 2003 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17325,"title":"Compromise","oj":"POJ","probNum":"2250","num":"L","publicDescId":3151322372056157,"publicDescVersion":1713906382000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\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\u003dUlm+Local+1997\"\u003eUlm Local 1997\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":27846,"title":"Advanced Fruits","oj":"HDU","probNum":"1503","num":"M","publicDescId":3129542714838240,"publicDescVersion":1714262466000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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\u003dUniversity+of+Ulm+Local+Contest+1999\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 1999 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":193351,"title":"Senior\u0027s String","oj":"HDU","probNum":"5282","num":"N","publicDescId":3302974641787635,"publicDescVersion":1713685068000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003dBestCoder+Round+%2347+%28%24%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #47 ($) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":21493,"title":"Multiplication Puzzle","oj":"POJ","probNum":"1651","num":"O","publicDescId":3113081517166373,"publicDescVersion":1714427063000,"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\u003dNortheastern+Europe+2001\"\u003eNortheastern Europe 2001\u003c/a\u003e, Far-Eastern Subregion\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":30577,"title":"Magic Number","oj":"HDU","probNum":"4323","num":"P","publicDescId":3120792145082927,"publicDescVersion":1713783578000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 Multi-University Training Contest 3 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eBJTU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":31833,"title":"Find Black Hand","oj":"HDU","probNum":"4271","num":"Q","publicDescId":3214542957701725,"publicDescVersion":1713642340000,"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\u003d2012+ACM%2FICPC+Asia+Regional+Changchun+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 ACM/ICPC Asia Regional Changchun Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":40722,"title":"Function Run Fun","oj":"HDU","probNum":"1579","num":"R","publicDescId":3224043599722612,"publicDescVersion":1714397057000,"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\u003d%B6%AC%C1%B7%C8%FD%BE%C5%D6%AE%D2%BB\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 冬练三九之一 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17329,"title":"LITTLE SHOP OF FLOWERS","oj":"POJ","probNum":"1157","num":"S","publicDescId":3151343259258769,"publicDescVersion":1714514845000,"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+1999\"\u003eIOI 1999\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"8038ee4866a8161719f394ca2ea4b4be","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}