zoukankan
html css js c++ java
算法栈
左神 中级提升班 3-3
编写一个程序,对一个栈里的整形数据,按升序进行排序,最小元素位于栈顶,要求最多只能使用一个额外的栈存放临时数据,但不得将元素复制到别的数据结构中
***
查看全文
相关阅读:
Codeforces Round #307 (Div. 2)E. GukiZ and GukiZiana
bzoj2957: 楼房重建,分块
分块入门。
poj3690 Constellations
Codeforces Round #451 (Div. 2)F. Restoring the Expression 字符串hash
Codeforces Round #456 (Div. 2)D. Fishes
Codeforces Round #450 (Div. 2)D. Unusual Sequences
快速排序+分治法
哈夫曼编码课程设计+最小优先对列建树。
浅谈差分约束系统
原文地址:https://www.cnblogs.com/t1314/p/15758007.html
最新文章
2015 HIAST Collegiate Programming Contest
Codeforces Round #422 C
Codeforces Round #422 B
Codeforces Round #422 A
2015 HIAST Collegiate Programming Contest J
2015 HIAST Collegiate Programming Contest H
2015 HIAST Collegiate Programming Contest G
2015 HIAST Collegiate Programming Contest F
2015 HIAST Collegiate Programming Contest D
2015 HIAST Collegiate Programming Contest C
热门文章
Educational Codeforces Round 32 E. Maximum Subsequence
hdu 5514 容斥原理
2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)
Gym 101142C CodeCoder vs TopForces
Wannafly挑战赛3
CodeForces 813D Two Melodies dp,思维,好题
Educational Codeforces Round 30 D. Merge Sort 思维,二分
CodeForces 869C The Intriguing Obsession 思维, dp或组合数
CodeForces 869E The Untended Antiquity 二维树状数组,随机hash
Educational Codeforces Round 37 (Rated for Div. 2)C. Swap Adjacent Elements
Copyright © 2011-2022 走看看