-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathatom.xml
486 lines (221 loc) · 24.2 KB
/
atom.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<title>Wilson's blog</title>
<link href="https://wilsonxia.cn/atom.xml" rel="self"/>
<link href="https://wilsonxia.cn/"/>
<updated>2024-08-11T07:55:33.698Z</updated>
<id>https://wilsonxia.cn/</id>
<author>
<name>Wilson Xia</name>
</author>
<generator uri="https://hexo.io/">Hexo</generator>
<entry>
<title>一些经典的系统idea</title>
<link href="https://wilsonxia.cn/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%9A%84%E7%B3%BB%E7%BB%9Fidea/"/>
<id>https://wilsonxia.cn/%E4%B8%80%E4%BA%9B%E7%BB%8F%E5%85%B8%E7%9A%84%E7%B3%BB%E7%BB%9Fidea/</id>
<published>2023-08-02T07:32:37.000Z</published>
<updated>2024-08-11T07:55:33.698Z</updated>
<summary type="html"><p>类似于 CS61C 提出的体系结构经典 idea<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>我也想在这里总结一下我在学习/读论文过程中看到的可复用的 idea<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>很多文章就是对这些 idea 进行排列组合<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>用于实现 tradeoff 的一部分<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>实现整体的性能目标<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span></p></summary>
<category term="research" scheme="https://wilsonxia.cn/categories/research/"/>
</entry>
<entry>
<title>6.824 Lab2B Raft</title>
<link href="https://wilsonxia.cn/6-824-Lab2B-Raft/"/>
<id>https://wilsonxia.cn/6-824-Lab2B-Raft/</id>
<published>2022-12-18T00:38:59.000Z</published>
<updated>2022-12-18T03:18:39.025Z</updated>
<summary type="html"><p>2022.12.18 完成了 Lab2B<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>内容是实现 Raft 的共识算法<span</summary>
<category term="system" scheme="https://wilsonxia.cn/tags/system/"/>
<category term="lab" scheme="https://wilsonxia.cn/tags/lab/"/>
<category term="distributed system" scheme="https://wilsonxia.cn/tags/distributed-system/"/>
</entry>
<entry>
<title>复读大三</title>
<link href="https://wilsonxia.cn/%E5%A4%8D%E8%AF%BB%E5%A4%A7%E4%B8%89/"/>
<id>https://wilsonxia.cn/%E5%A4%8D%E8%AF%BB%E5%A4%A7%E4%B8%89/</id>
<published>2022-09-12T15:41:44.000Z</published>
<updated>2022-12-18T03:17:40.507Z</updated>
<summary type="html"><p>开学的时候<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>我感到很想完成几门早有耳闻的北美CS课程的实验<span</summary>
</entry>
<entry>
<title>6.824 Lab1 MapReduce</title>
<link href="https://wilsonxia.cn/6-824-Lab1-MapReduce/"/>
<id>https://wilsonxia.cn/6-824-Lab1-MapReduce/</id>
<published>2022-03-19T16:01:19.000Z</published>
<updated>2022-03-19T16:37:58.690Z</updated>
<summary type="html"><p>前前后后做了15个小时<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>看到<code>PASSED ALL 30 TESTING</summary>
<category term="system" scheme="https://wilsonxia.cn/tags/system/"/>
<category term="lab" scheme="https://wilsonxia.cn/tags/lab/"/>
<category term="distributed system" scheme="https://wilsonxia.cn/tags/distributed-system/"/>
</entry>
<entry>
<title>CF Edu123 题解</title>
<link href="https://wilsonxia.cn/CF-Edu123-%E9%A2%98%E8%A7%A3/"/>
<id>https://wilsonxia.cn/CF-Edu123-%E9%A2%98%E8%A7%A3/</id>
<published>2022-03-07T13:47:25.000Z</published>
<updated>2022-03-22T13:23:01.342Z</updated>
<summary type="html"><h2 id="f-basis">F. Basis</h2>
<p><a href="https://codeforces.com/contest/1644/problem/F">题面</a></p>
<p>考虑一群在操作 2 下可以互相变换的数组<span</summary>
<category term="题解" scheme="https://wilsonxia.cn/categories/%E9%A2%98%E8%A7%A3/"/>
<category term="斯特林数" scheme="https://wilsonxia.cn/tags/%E6%96%AF%E7%89%B9%E6%9E%97%E6%95%B0/"/>
<category term="容斥原理" scheme="https://wilsonxia.cn/tags/%E5%AE%B9%E6%96%A5%E5%8E%9F%E7%90%86/"/>
</entry>
<entry>
<title>Trie树维护集合相交性</title>
<link href="https://wilsonxia.cn/Trie%E6%A0%91%E7%BB%B4%E6%8A%A4%E9%9B%86%E5%90%88%E7%9B%B8%E4%BA%A4%E6%80%A7/"/>
<id>https://wilsonxia.cn/Trie%E6%A0%91%E7%BB%B4%E6%8A%A4%E9%9B%86%E5%90%88%E7%9B%B8%E4%BA%A4%E6%80%A7/</id>
<published>2022-03-03T09:40:59.181Z</published>
<updated>2022-03-07T15:03:14.266Z</updated>
<summary type="html"><p>这篇文章讲一个 trick<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>他可以解决如下问题<span class="bd-box"><h-char</summary>
<category term="奇技淫巧" scheme="https://wilsonxia.cn/categories/%E5%A5%87%E6%8A%80%E6%B7%AB%E5%B7%A7/"/>
</entry>
<entry>
<title>ARC136题解</title>
<link href="https://wilsonxia.cn/ARC136%E9%A2%98%E8%A7%A3/"/>
<id>https://wilsonxia.cn/ARC136%E9%A2%98%E8%A7%A3/</id>
<published>2022-03-01T13:17:35.000Z</published>
<updated>2022-03-06T17:20:13.857Z</updated>
<summary type="html"><p>这场 ARC 比较考验观察能力<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>就是找到切入点的能力<span class="bd-box"><h-char</summary>
<category term="题解" scheme="https://wilsonxia.cn/tags/%E9%A2%98%E8%A7%A3/"/>
</entry>
<entry>
<title>ARC135题解</title>
<link href="https://wilsonxia.cn/ARC135%E9%A2%98%E8%A7%A3/"/>
<id>https://wilsonxia.cn/ARC135%E9%A2%98%E8%A7%A3/</id>
<published>2022-02-14T14:27:52.000Z</published>
<updated>2022-02-15T04:32:24.288Z</updated>
<summary type="html"><p>F暂时有个地方没搞明白<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>但我会研究题解和正确代码<span class="bd-box"><h-char</summary>
<category term="题解" scheme="https://wilsonxia.cn/tags/%E9%A2%98%E8%A7%A3/"/>
</entry>
<entry>
<title>在Linux上使用clash</title>
<link href="https://wilsonxia.cn/%E5%9C%A8Linux%E4%B8%8A%E4%BD%BF%E7%94%A8clash/"/>
<id>https://wilsonxia.cn/%E5%9C%A8Linux%E4%B8%8A%E4%BD%BF%E7%94%A8clash/</id>
<published>2022-01-21T03:31:11.000Z</published>
<updated>2022-02-06T18:04:12.952Z</updated>
<summary type="html"><p>更新<span class="bd-box"><h-char class="bd bd-beg"><h-inner>：</h-inner></h-char></span>我火星了<span class="bd-box"><h-char class="bd</summary>
<category term="工具" scheme="https://wilsonxia.cn/categories/%E5%B7%A5%E5%85%B7/"/>
</entry>
<entry>
<title>页面调度算法</title>
<link href="https://wilsonxia.cn/%E9%A1%B5%E9%9D%A2%E8%B0%83%E5%BA%A6%E7%AE%97%E6%B3%95/"/>
<id>https://wilsonxia.cn/%E9%A1%B5%E9%9D%A2%E8%B0%83%E5%BA%A6%E7%AE%97%E6%B3%95/</id>
<published>2022-01-07T04:31:38.000Z</published>
<updated>2022-02-06T18:04:25.596Z</updated>
<summary type="html"><h2 id="最优调度算法为什么最优">最优调度算法为什么最优</h2>
<p>我们发现换页时换入的页总是固定的<span class="bd-box"><h-char class="bd</summary>
<category term="操作系统" scheme="https://wilsonxia.cn/categories/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/"/>
</entry>
<entry>
<title>二分图匹配</title>
<link href="https://wilsonxia.cn/%E4%BA%8C%E5%88%86%E5%9B%BE%E5%8C%B9%E9%85%8D/"/>
<id>https://wilsonxia.cn/%E4%BA%8C%E5%88%86%E5%9B%BE%E5%8C%B9%E9%85%8D/</id>
<published>2021-10-30T15:37:16.000Z</published>
<updated>2022-01-02T02:15:35.175Z</updated>
<summary type="html"><p>思路<span class="bd-box"><h-char class="bd bd-beg"><h-inner>：</h-inner></h-char></span>先通过交错路和增广路的概念建立起处理最大匹配的工具<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>证明匹配最大的充要条件是图中没有增广路<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>然后证明Hall定理<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>顺便证明了婚配定理<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>并利用之证明最大匹配与最小点覆盖的对偶性<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>最后证明最小边覆盖与最大独立集的对偶性<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>以及这四者之间的关系<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span></p></summary>
<category term="算法" scheme="https://wilsonxia.cn/categories/%E7%AE%97%E6%B3%95/"/>
<category term="图论" scheme="https://wilsonxia.cn/tags/%E5%9B%BE%E8%AE%BA/"/>
<category term="二分图匹配" scheme="https://wilsonxia.cn/tags/%E4%BA%8C%E5%88%86%E5%9B%BE%E5%8C%B9%E9%85%8D/"/>
</entry>
<entry>
<title>Public Transport System</title>
<link href="https://wilsonxia.cn/Public-Transport-System/"/>
<id>https://wilsonxia.cn/Public-Transport-System/</id>
<published>2021-10-14T09:36:16.000Z</published>
<updated>2021-10-15T03:50:30.820Z</updated>
<summary type="html"><h2 id="题意">题意</h2>
<p>给定一个有向图<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>每条边有边权<span class="markdown-them-math-inline">$a_e$</span>和<span class="markdown-them-math-inline">$b_e$</span><span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span><span class="markdown-them-math-inline">$0&lt;a_e,b_e;\;b_e&lt;a_e$</span><span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>记一条路径由<span class="markdown-them-math-inline">$k$</span>条边<span class="markdown-them-math-inline">$e_1,e_2,...,e_k$</span>组成<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>那么这条路径中<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>边<span class="markdown-them-math-inline">$e_1$</span>的权值为<span class="markdown-them-math-inline">$a_{e_1}$</span><span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span><span class="markdown-them-math-inline">$e_i(i&gt;1)$</span>的权值为<span class="bd-box"><h-char class="bd bd-beg"><h-inner>：</h-inner></h-char></span></p>
<div class="markdown-them-math-block">$$\begin{cases}
a_{e_i}&amp;a_{e_i}\leq a_{e_{i-1}},\\
a_{e_{i}}-b_{e_i}&amp;a_{e_i}&gt;a_{e_{i-1}}.
\end{cases}
$$</div><p>这条路径的权值是这条路径上边的权值之和<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>求从点<span class="markdown-them-math-inline">$1$</span>出发到所有点的最短路长度<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span></p>
<div class="markdown-them-math-block">$$\begin{align*}
n\leq 1\times10^5,\ m\leq 2\times10^5.
\end{align*}
$$</div></summary>
<category term="题解" scheme="https://wilsonxia.cn/categories/%E9%A2%98%E8%A7%A3/"/>
<category term="思维" scheme="https://wilsonxia.cn/tags/%E6%80%9D%E7%BB%B4/"/>
<category term="建图" scheme="https://wilsonxia.cn/tags/%E5%BB%BA%E5%9B%BE/"/>
</entry>
<entry>
<title>Charged Tree</title>
<link href="https://wilsonxia.cn/Charged-Tree/"/>
<id>https://wilsonxia.cn/Charged-Tree/</id>
<published>2021-09-21T08:17:39.076Z</published>
<updated>2021-10-07T12:40:38.384Z</updated>
<summary type="html"><p>题意<span class="bd-box"><h-char class="bd bd-beg"><h-inner>：</h-inner></h-char></span>给定一棵有根带权树<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>有两种操作下移和上移<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>下移<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>即每个节点将自己的权值均分给各个儿子<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>假设叶子结点有一个无限长的儿子链<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>即叶子结点每次下移都会把自己和整条儿子链下移一位<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>每个节点的新值就是它从父亲得到的那个值<span class="bd-box"><h-char class="bd bd-end"><h-inner>（</h-inner></h-char></span>他自己原来的值已经分给了儿子<span class="bd-box"><h-char class="bd bd-beg"><h-inner>）</h-inner></h-char><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>特别地<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>一次下移操作后根变成0<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>上移<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>即对每个节点<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>将所有儿子的权值加起来赋给自己<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span></p></summary>
<category term="题解" scheme="https://wilsonxia.cn/categories/%E9%A2%98%E8%A7%A3/"/>
<category term="思维" scheme="https://wilsonxia.cn/tags/%E6%80%9D%E7%BB%B4/"/>
</entry>
<entry>
<title>tarjan算法（求最近公共祖先）</title>
<link href="https://wilsonxia.cn/tarjan%E7%AE%97%E6%B3%95%EF%BC%88%E6%B1%82%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88%EF%BC%89/"/>
<id>https://wilsonxia.cn/tarjan%E7%AE%97%E6%B3%95%EF%BC%88%E6%B1%82%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88%EF%BC%89/</id>
<published>2021-09-18T09:33:11.008Z</published>
<updated>2021-11-28T16:31:24.172Z</updated>
<summary type="html"><p>本文讲解用于求解最近公共祖先<span class="bd-box"><h-char class="bd bd-end"><h-inner>（</h-inner></h-char></span>Least Common Ancestor, LCA<span</summary>
<category term="算法" scheme="https://wilsonxia.cn/categories/%E7%AE%97%E6%B3%95/"/>
<category term="最近公共祖先" scheme="https://wilsonxia.cn/tags/%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/"/>
<category term="并查集" scheme="https://wilsonxia.cn/tags/%E5%B9%B6%E6%9F%A5%E9%9B%86/"/>
</entry>
<entry>
<title>PWTC day4补题记录</title>
<link href="https://wilsonxia.cn/PWTC%20day4%E8%A1%A5%E9%A2%98%E8%AE%B0%E5%BD%95/"/>
<id>https://wilsonxia.cn/PWTC%20day4%E8%A1%A5%E9%A2%98%E8%AE%B0%E5%BD%95/</id>
<published>2021-08-20T13:51:24.687Z</published>
<updated>2021-10-07T12:40:13.290Z</updated>
<summary type="html"><h2 id="f">F</h2>
<p>题意<span class="bd-box"><h-char class="bd bd-beg"><h-inner>：</h-inner></h-char></span>求树链mex<span</summary>
<category term="题解" scheme="https://wilsonxia.cn/categories/%E9%A2%98%E8%A7%A3/"/>
</entry>
<entry>
<title>FFT</title>
<link href="https://wilsonxia.cn/FFT/"/>
<id>https://wilsonxia.cn/FFT/</id>
<published>2021-07-18T03:51:49.629Z</published>
<updated>2022-03-22T11:54:43.024Z</updated>
<summary type="html"><p>FFT可以在<span class="markdown-them-math-inline">$O(n\log n)$</span>的时间内在多项式的点值表示法和系数表示法之间相互转换<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>从而可以加速多项式乘法<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span></p></summary>
<category term="算法" scheme="https://wilsonxia.cn/categories/%E7%AE%97%E6%B3%95/"/>
<category term="FFT" scheme="https://wilsonxia.cn/tags/FFT/"/>
</entry>
<entry>
<title>SB树</title>
<link href="https://wilsonxia.cn/SB%E6%A0%91/"/>
<id>https://wilsonxia.cn/SB%E6%A0%91/</id>
<published>2021-06-10T19:11:22.884Z</published>
<updated>2021-10-07T12:40:08.427Z</updated>
<summary type="html"><p>这棵二叉树中包含了所有的非负有理数<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>首先看它的构造<span class="bd-box"><h-char</summary>
<category term="数据结构" scheme="https://wilsonxia.cn/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"/>
</entry>
<entry>
<title>CF708D2</title>
<link href="https://wilsonxia.cn/CF708D2/"/>
<id>https://wilsonxia.cn/CF708D2/</id>
<published>2021-04-29T03:03:50.328Z</published>
<updated>2021-10-07T12:40:43.202Z</updated>
<summary type="html"><h2 id="d题">D题</h2>
<p>题很好<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>感觉思维得到了升华<span</summary>
<category term="题解" scheme="https://wilsonxia.cn/categories/%E9%A2%98%E8%A7%A3/"/>
</entry>
<entry>
<title>区间众数</title>
<link href="https://wilsonxia.cn/%E5%8C%BA%E9%97%B4%E4%BC%97%E6%95%B0/"/>
<id>https://wilsonxia.cn/%E5%8C%BA%E9%97%B4%E4%BC%97%E6%95%B0/</id>
<published>2021-04-20T05:20:43.094Z</published>
<updated>2021-10-07T12:41:05.609Z</updated>
<summary type="html"><p>通用求众数离线做法<span class="bd-box"><h-char class="bd bd-beg"><h-inner>：</h-inner></h-char></span>离散化之后<span class="bd-box"><h-char class="bd</summary>
<category term="算法" scheme="https://wilsonxia.cn/categories/%E7%AE%97%E6%B3%95/"/>
</entry>
<entry>
<title>筛选法建堆</title>
<link href="https://wilsonxia.cn/%E7%AD%9B%E9%80%89%E6%B3%95%E5%BB%BA%E5%A0%86/"/>
<id>https://wilsonxia.cn/%E7%AD%9B%E9%80%89%E6%B3%95%E5%BB%BA%E5%A0%86/</id>
<published>2021-02-05T04:07:28.000Z</published>
<updated>2021-10-17T15:39:10.261Z</updated>
<summary type="html"><p>这可能是本学期学习数据结构与算法课的最大收获<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>就是知道了还有线性建堆的方法<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char></span>线性建堆可能也是有应用场景的<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>比如用<span class="markdown-them-math-inline">$O(n)$</span>的空间及时间复杂度<span class="bd-box"><h-char class="bd bd-beg"><h-inner>，</h-inner></h-char></span>取出前<span class="markdown-them-math-inline">$n/\log n$</span>大的所有数<span class="bd-box"><h-char class="bd bd-beg"><h-inner>。</h-inner></h-char><h-char class="bd bd-end"><h-inner>（</h-inner></h-char><h-char class="bd bd-beg"><h-inner>？</h-inner></h-char></span></p></summary>
<category term="奇技淫巧" scheme="https://wilsonxia.cn/categories/%E5%A5%87%E6%8A%80%E6%B7%AB%E5%B7%A7/"/>
<category term="筛选法建堆" scheme="https://wilsonxia.cn/tags/%E7%AD%9B%E9%80%89%E6%B3%95%E5%BB%BA%E5%A0%86/"/>
</entry>
</feed>