单调队列

Begin: 1470362400000

End: 1471244400000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 2823	Sliding Window
B	HDU 3415	Max Sum of Max-K-sub-sequence
C	HDU 3401	Trade
D	HDU 3530	Subsequence
E	POJ 3017	Cut the Sequence
F	POJ 3245	Sequence Partitioning
G	HDU 2993	MAX Average Problem
H	HDU 2829	Lawrence
I	HDU 2830	Matrix Swapping II
J	HDU 3507	Print Article
K	HDU 3508	Product of coprimes

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":126368,"title":"单调队列 ","type":0,"openness":0,"authStatus":1,"begin":1470362400000,"end":1471244400000,"createTime":0,"started":true,"ended":true,"managerId":70147,"managerName":"pblr","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":16694,"title":"Sliding Window","oj":"POJ","probNum":"2823","num":"A","publicDescId":3149832335839297,"publicDescVersion":1714884685000,"properties":[{"title":"Time limit","content":"12000 ms","spoiler":false},{"title":"Case time limit","content":"5000 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\u003dPOJ+Monthly--2006.04.28\"\u003ePOJ Monthly--2006.04.28\u003c/a\u003e, Ikki\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":11533,"title":"Max Sum of Max-K-sub-sequence","oj":"HDU","probNum":"3415","num":"B","publicDescId":3161334104978846,"publicDescVersion":1714893743000,"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\u003dHDOJ+Monthly+Contest+%A8C+2010.06.05\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.06.05 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eshǎ崽@HDU\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":14693,"title":"Trade","oj":"HDU","probNum":"3401","num":"C","publicDescId":3165732405469430,"publicDescVersion":1714941882000,"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\u003dHDOJ+Monthly+Contest+%A8C+2010.05.01\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.05.01 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elxhgww\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":11253,"title":"Subsequence","oj":"HDU","probNum":"3530","num":"D","publicDescId":3161495977139296,"publicDescVersion":1714902093000,"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\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A810%A3%A9%A1%AA%A1%AAHost+by+HEU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（10）——Host by HEU \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":13735,"title":"Cut the Sequence","oj":"POJ","probNum":"3017","num":"E","publicDescId":3162707120450360,"publicDescVersion":1715109470000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"131072 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\u003dPOJ+Monthly--2006.09.29\"\u003ePOJ Monthly--2006.09.29\u003c/a\u003e, zhucheng\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":24707,"title":"Sequence Partitioning","oj":"POJ","probNum":"3245","num":"F","publicDescId":3104328098436029,"publicDescVersion":1714576797000,"properties":[{"title":"Time limit","content":"8000 ms","spoiler":false},{"title":"Case time limit","content":"5000 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\u003dPOJ+Monthly--2007.07.08\"\u003ePOJ Monthly--2007.07.08\u003c/a\u003e, Chen, Danqi\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":18065,"title":"MAX Average Problem","oj":"HDU","probNum":"2993","num":"G","publicDescId":3153420624484169,"publicDescVersion":1715017137000,"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\u003d2009+Multi-University+Training+Contest+19+-+Host+by+BNU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 19 - Host by BNU \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":18066,"title":"Lawrence","oj":"HDU","probNum":"2829","num":"H","publicDescId":3153449602600340,"publicDescVersion":1715140643000,"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\u003d2009+Multi-University+Training+Contest+2+-+Host+by+TJU+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 2 - Host by TJU  \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":20561,"title":"Matrix Swapping II","oj":"HDU","probNum":"2830","num":"I","publicDescId":3108281888072625,"publicDescVersion":1714459246000,"properties":[{"title":"Time limit","content":"3000 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+2+-+Host+by+TJU+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 2 - Host by TJU  \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":10720,"title":"Print Article","oj":"HDU","probNum":"3507","num":"J","publicDescId":3157926675979512,"publicDescVersion":1715075779000,"properties":[{"title":"Time limit","content":"3000 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\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A87%A3%A9%A1%AA%A1%AAHost+by+HIT+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（7）——Host by HIT  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eXnozero\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":10805,"title":"Product of coprimes","oj":"HDU","probNum":"3508","num":"K","publicDescId":3158678395049249,"publicDescVersion":1714637559000,"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\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A88%A3%A9%A1%AA%A1%AAHost+by+ECNU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（8）——Host by ECNU \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":"9a6c7e35616c30bbc3044ac86df43c08","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}