Your browser does not support the audio element.

随笔分类 -  算法-一些排序

快速排序
摘要：重新学习算法，快排，算法导论中的 import "fmt" // Partition 分治这一部分 func Partition(A []int, l, r int) int { q := l - 1 for j := l; j < r; j++ { if A[j] <= A[r] { q++ A[ 阅读全文
posted @ 2022-04-10 16:44 happy_codes 阅读(19) 评论(0) 推荐(0)
1420 数袋鼠好有趣(贪心二分)
摘要：1420 数袋鼠好有趣 题目来源： CodeForces 基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 1420 数袋鼠好有趣 题目来源： CodeForces 基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 1420 数袋鼠 阅读全文
posted @ 2017-10-03 12:15 happy_codes 阅读(443) 评论(0) 推荐(0)
Genealogical tree
摘要：Genealogical tree Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6032 Accepted: 3973 Special Judge Description The system of Martians' bloo 阅读全文
posted @ 2017-08-23 20:25 happy_codes 阅读(273) 评论(0) 推荐(0)
FFF at Valentine(强连通分量缩点+拓扑排序)
摘要：FFF at Valentine Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 730 Accepted Submission(s): 359 阅读全文
posted @ 2017-08-23 17:30 happy_codes 阅读(320) 评论(0) 推荐(0)
Hints of sd0061(快排思想)
摘要：Hints of sd0061 Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 492 Accepted Submission(s): 106 阅读全文
posted @ 2017-07-26 10:32 happy_codes 阅读(809) 评论(0) 推荐(0)
M - Ordering Tasks(拓扑排序)
摘要：M - Ordering Tasks Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu M - Ordering Tasks Time Limit:3000MS Memory Limit:0KB 64bit IO Forma 阅读全文
posted @ 2016-07-22 18:01 happy_codes 阅读(201) 评论(0) 推荐(0)
Frosh Week(归并排序求逆序数)
摘要：H - Frosh Week Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u H - Frosh Week Time Limit:1000MS Memory Limit:32768KB 64bit IO For 阅读全文
posted @ 2016-07-21 11:04 happy_codes 阅读(453) 评论(0) 推荐(0)