-
Notifications
You must be signed in to change notification settings - Fork 0
/
atom.xml
519 lines (324 loc) · 19.6 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
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<title>瓜子壳专用垃圾桶</title>
<subtitle>Tech Otaku Save the World</subtitle>
<link href="/atom.xml" rel="self"/>
<link href="http://WigginsLi.github.io/"/>
<updated>2020-02-16T10:09:09.458Z</updated>
<id>http://WigginsLi.github.io/</id>
<author>
<name>$ \cal WiLe $</name>
</author>
<generator uri="http://hexo.io/">Hexo</generator>
<entry>
<title>MIT-ALgo-lecture</title>
<link href="http://WigginsLi.github.io/2020/02/10/MIT-ALgo-lecture/"/>
<id>http://WigginsLi.github.io/2020/02/10/MIT-ALgo-lecture/</id>
<published>2020-02-09T22:29:30.000Z</published>
<updated>2020-02-16T10:09:09.458Z</updated>
<summary type="html">
<blockquote>
<p>分享1-3集 <strong>MIT的算法公开课程</strong>（ <a
</summary>
<category term="技术" scheme="http://WigginsLi.github.io/categories/%E6%8A%80%E6%9C%AF/"/>
</entry>
<entry>
<title>2020_01_12</title>
<link href="http://WigginsLi.github.io/2020/01/13/2020-01-12/"/>
<id>http://WigginsLi.github.io/2020/01/13/2020-01-12/</id>
<published>2020-01-12T22:35:32.000Z</published>
<updated>2020-01-12T15:02:05.461Z</updated>
<summary type="html">
<h2 id="套题"><a href="#套题" class="headerlink" title="套题"></a>套题</h2><ul>
<li><p>牛客练习赛57</p>
<ul>
<li>A - 简单模拟</li>
<li>B -
</summary>
<category term="每日小记" scheme="http://WigginsLi.github.io/categories/%E6%AF%8F%E6%97%A5%E5%B0%8F%E8%AE%B0/"/>
</entry>
<entry>
<title>博弈论总结</title>
<link href="http://WigginsLi.github.io/2019/10/17/game-theory/"/>
<id>http://WigginsLi.github.io/2019/10/17/game-theory/</id>
<published>2019-10-16T21:18:26.000Z</published>
<updated>2019-10-17T13:25:19.744Z</updated>
<summary type="html">
<h3 id="巴什博弈"><a href="#巴什博弈" class="headerlink" title="巴什博弈"></a>巴什博弈</h3><ul>
<li>能取$ [1-k] -&gt; n\%(k+1) $</li>
<li>给定取数范围集合S -&gt;
</summary>
<category term="技术" scheme="http://WigginsLi.github.io/categories/%E6%8A%80%E6%9C%AF/"/>
</entry>
<entry>
<title>技术部二面试题</title>
<link href="http://WigginsLi.github.io/2019/09/10/jsbem/"/>
<id>http://WigginsLi.github.io/2019/09/10/jsbem/</id>
<published>2019-09-09T18:31:59.000Z</published>
<updated>2019-09-09T10:34:35.364Z</updated>
<summary type="html">
<h2 id="流程"><a href="#流程" class="headerlink"
</summary>
<category term="技术" scheme="http://WigginsLi.github.io/categories/%E6%8A%80%E6%9C%AF/"/>
</entry>
<entry>
<title>__int128类型小记</title>
<link href="http://WigginsLi.github.io/2019/07/19/int128/"/>
<id>http://WigginsLi.github.io/2019/07/19/int128/</id>
<published>2019-07-19T06:31:10.467Z</published>
<updated>2019-08-09T11:06:59.587Z</updated>
<summary type="html">
<blockquote>
<p>范围是 $[- 2^{127} , 2^{127}-1]$ </p>
<p>基本用法与基本数据类型类似，但不能用$cin,cout$读入输出</p>
</blockquote>
<p>这里记下==输入输出“外挂”==：</p>
</summary>
<category term="Experience" scheme="http://WigginsLi.github.io/categories/Experience/"/>
<category term="数据类型" scheme="http://WigginsLi.github.io/tags/%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B/"/>
</entry>
<entry>
<title>如何更稳定地科学上网-记vultr被墙后的v2ray+WebSocket+TLS部署过程</title>
<link href="http://WigginsLi.github.io/2019/06/16/v2ray-deploy/"/>
<id>http://WigginsLi.github.io/2019/06/16/v2ray-deploy/</id>
<published>2019-06-16T14:02:20.000Z</published>
<updated>2019-08-09T11:07:06.917Z</updated>
<summary type="html">
<p><del>$Github Page$ 姑且算是国外的网站吧，在上面记一下科学上网应该没问题吧（狗头保命</del></p>
<p><strong>&lt;本文仅为技术交流，请勿转载&gt;</strong></p>
</summary>
<category term="科学上网" scheme="http://WigginsLi.github.io/categories/%E7%A7%91%E5%AD%A6%E4%B8%8A%E7%BD%91/"/>
<category term="v2ray" scheme="http://WigginsLi.github.io/tags/v2ray/"/>
</entry>
<entry>
<title>p3080 [USACO13MAR]牛跑The Cow Run [区间DP]</title>
<link href="http://WigginsLi.github.io/2019/05/30/p3080/"/>
<id>http://WigginsLi.github.io/2019/05/30/p3080/</id>
<published>2019-05-29T21:07:47.000Z</published>
<updated>2019-05-29T14:17:34.535Z</updated>
<summary type="html">
<p>$\implies$ <a href="https://www.luogu.org/problemnew/show/P3080" target="_blank" rel="noopener">传送门</a></p>
<ul>
<li><p>题目大意:</p>
<ul>
<li>给定一条坐标轴上$n$个点相对于原点的位置(正负均有)</li>
<li>从原点出发去占领这些点,被占领前每个点单位时间消耗一个单位代价</li>
<li>每单位时间可以移动一个单位长度,问最少花费多少代价</li>
</ul>
</li>
</ul>
</summary>
<category term="动态规划" scheme="http://WigginsLi.github.io/categories/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
<category term="dp" scheme="http://WigginsLi.github.io/tags/dp/"/>
</entry>
<entry>
<title>cf-1114D Flood Fill [区间DP]</title>
<link href="http://WigginsLi.github.io/2019/05/30/cf-1114D/"/>
<id>http://WigginsLi.github.io/2019/05/30/cf-1114D/</id>
<published>2019-05-29T18:58:26.000Z</published>
<updated>2019-05-29T14:17:11.031Z</updated>
<summary type="html">
<p>$\implies$ <a href="https://www.luogu.org/problemnew/show/CF1114D" target="_blank" rel="noopener">传送门</a></p>
<ul>
<li><p>题目大意:</p>
<ul>
<li>给定$n$个方块有相应的颜色$c_i$,定义相邻的方块颜色相同则可以称为一个联通颜色块.</li>
<li>现在让你初始选定一个方块$p$,每次可以将该方块所在的联通颜色块换成一个颜色,求最少的操作次数使得$n$个方块全部为一种颜色</li>
</ul>
</li>
</ul>
</summary>
<category term="动态规划" scheme="http://WigginsLi.github.io/categories/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
<category term="区间dp" scheme="http://WigginsLi.github.io/tags/%E5%8C%BA%E9%97%B4dp/"/>
<category term="dp" scheme="http://WigginsLi.github.io/tags/dp/"/>
</entry>
<entry>
<title>洛谷p1119-灾后重建 [floyd]</title>
<link href="http://WigginsLi.github.io/2019/05/11/p1119/"/>
<id>http://WigginsLi.github.io/2019/05/11/p1119/</id>
<published>2019-05-11T11:15:57.000Z</published>
<updated>2019-05-28T14:38:40.710Z</updated>
<summary type="html">
<p>$\implies$ <a href="https://www.luogu.org/problemnew/show/P1119" target="_blank" rel="noopener">传送门</a></p>
<ul>
<li>题目大意: 给出图中$x_i$节点被加进图里的时间$t_i$;<br><br>多个询问$Q$,求$t_j$时间,$x_j,y_j$的最短距离
</summary>
<category term="动态规划" scheme="http://WigginsLi.github.io/categories/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
<category term="思维" scheme="http://WigginsLi.github.io/categories/%E6%80%9D%E7%BB%B4/"/>
<category term="floyd" scheme="http://WigginsLi.github.io/tags/floyd/"/>
</entry>
<entry>
<title>ACM协会+青创课第二节KMP讲解资料</title>
<link href="http://WigginsLi.github.io/2019/05/06/kmp-teaching/"/>
<id>http://WigginsLi.github.io/2019/05/06/kmp-teaching/</id>
<published>2019-05-06T01:00:51.000Z</published>
<updated>2019-05-27T12:07:16.072Z</updated>
<summary type="html">
<p>一篇讲的很好的博客, $ \implies $ <a href="https://www.cnblogs.com/yjiyjige/p/3263858.html" target="_blank" rel="noopener">这里</a></p>
<p>PPT下载 $\implies$ <a href="https://pan.baidu.com/s/13O9WiAkaQYDrKE1UMJAS4w" target="_blank" rel="noopener">百度网盘</a> 提取码: pqs9<br>或者复制这一段: </p>
<pre><code>链接: https://pan.baidu.com/s/13O9WiAkaQYDrKE1UMJAS4w 提取码: pqs9 复制这段内容后打开百度网盘手机App，操作更方便哦
</code></pre><hr>
</summary>
<category term="字符串" scheme="http://WigginsLi.github.io/categories/%E5%AD%97%E7%AC%A6%E4%B8%B2/"/>
<category term="KMP" scheme="http://WigginsLi.github.io/tags/KMP/"/>
</entry>
<entry>
<title>【04.11训练赛记录】</title>
<link href="http://WigginsLi.github.io/2019/04/13/19-4-11-Training/"/>
<id>http://WigginsLi.github.io/2019/04/13/19-4-11-Training/</id>
<published>2019-04-12T19:57:36.000Z</published>
<updated>2019-08-09T11:06:43.570Z</updated>
<summary type="html">
<blockquote>
<p>出题数垫底祭QAQ</p>
</blockquote>
<p>$\implies$<a href="https://codeforces.com/group/NVaJtLaLjS/contest/242532/attachments/download/6308/20172018-acmicpc-pacific-northwest-regional-contest-div-1-en.pdf" target="_blank" rel="noopener">题目文档PDF(似乎只有同一个group才能打开)</a></p>
<blockquote>
<p>打不开的小伙伴请自行搜索<br><strong>(20172018-acmicpc-pacific-northwest-regional-contest-div-1)</strong><br>(づ￣3￣)づ</p>
</blockquote>
</summary>
<category term="Training" scheme="http://WigginsLi.github.io/categories/Training/"/>
</entry>
<entry>
<title>CF-1141E-Superhero Battle【数学+细节】</title>
<link href="http://WigginsLi.github.io/2019/03/21/cf-1141E/"/>
<id>http://WigginsLi.github.io/2019/03/21/cf-1141E/</id>
<published>2019-03-20T23:43:15.000Z</published>
<updated>2019-03-20T15:55:18.113Z</updated>
<summary type="html">
<p>$\implies$<a href="http://codeforces.com/problemset/problem/1141/E" target="_blank" rel="noopener">传送门</a></p>
<blockquote>
<p>乍看下是水题，结果wa得措不及防</p>
</blockquote>
</summary>
<category term="数论" scheme="http://WigginsLi.github.io/categories/%E6%95%B0%E8%AE%BA/"/>
<category term="数学" scheme="http://WigginsLi.github.io/tags/%E6%95%B0%E5%AD%A6/"/>
</entry>
<entry>
<title>CF-1141F2-Same Sum Blocks (Hard)【数据结构+贪心】</title>
<link href="http://WigginsLi.github.io/2019/03/21/cf-1141F2/"/>
<id>http://WigginsLi.github.io/2019/03/21/cf-1141F2/</id>
<published>2019-03-20T23:42:56.000Z</published>
<updated>2019-03-20T16:15:35.746Z</updated>
<summary type="html">
<p>$\implies$<a href="http://codeforces.com/contest/1141/problem/F2" target="_blank" rel="noopener">传送门</a></p>
<blockquote>
<p>学习对$map$的灵活应用</p>
</blockquote>
</summary>
<category term="数据结构" scheme="http://WigginsLi.github.io/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"/>
<category term="贪心" scheme="http://WigginsLi.github.io/categories/%E8%B4%AA%E5%BF%83/"/>
<category term="map" scheme="http://WigginsLi.github.io/tags/map/"/>
</entry>
<entry>
<title>CF-414B-Mashmokh and ACM【DP】</title>
<link href="http://WigginsLi.github.io/2019/03/21/cf414B/"/>
<id>http://WigginsLi.github.io/2019/03/21/cf414B/</id>
<published>2019-03-20T22:39:44.000Z</published>
<updated>2019-03-20T15:17:04.355Z</updated>
<summary type="html">
<p>$\implies$ <a href="https://codeforces.com/problemset/problem/414/B" target="_blank" rel="noopener">传送门</a></p>
<blockquote>
<p>简单dp，学一下套路</p>
</blockquote>
</summary>
<category term="动态规划" scheme="http://WigginsLi.github.io/categories/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
<category term="dp" scheme="http://WigginsLi.github.io/tags/dp/"/>
</entry>
<entry>
<title>hdu-6470-Count【矩阵快速幂+二项式定理】</title>
<link href="http://WigginsLi.github.io/2019/03/19/hdu-6470/"/>
<id>http://WigginsLi.github.io/2019/03/19/hdu-6470/</id>
<published>2019-03-18T23:26:52.000Z</published>
<updated>2019-05-05T16:58:33.874Z</updated>
<summary type="html">
<p>$\implies$<a href="http://acm.hdu.edu.cn/showproblem.php?pid=6470" target="_blank" rel="noopener">传送门</a></p>
<blockquote>
<p>加深了对矩阵快速幂的理解</p>
</blockquote>
</summary>
<category term="组合数学" scheme="http://WigginsLi.github.io/categories/%E7%BB%84%E5%90%88%E6%95%B0%E5%AD%A6/"/>
<category term="矩阵快速幂" scheme="http://WigginsLi.github.io/tags/%E7%9F%A9%E9%98%B5%E5%BF%AB%E9%80%9F%E5%B9%82/"/>
<category term="二项式定理" scheme="http://WigginsLi.github.io/tags/%E4%BA%8C%E9%A1%B9%E5%BC%8F%E5%AE%9A%E7%90%86/"/>
</entry>
<entry>
<title>hdu-6467简单数学题【数论/组合数学】</title>
<link href="http://WigginsLi.github.io/2019/03/19/hdu-6467/"/>
<id>http://WigginsLi.github.io/2019/03/19/hdu-6467/</id>
<published>2019-03-18T21:56:02.000Z</published>
<updated>2019-03-18T15:17:06.077Z</updated>
<summary type="html">
<p>$\implies$<a href="http://acm.hdu.edu.cn/showproblem.php?pid=6467" target="_blank" rel="noopener">HDU传送门</a> </p>
<blockquote>
<p>推式子题，赛场上没推出来，学习学习</p>
</blockquote>
</summary>
<category term="数论" scheme="http://WigginsLi.github.io/categories/%E6%95%B0%E8%AE%BA/"/>
<category term="组合数学" scheme="http://WigginsLi.github.io/categories/%E7%BB%84%E5%90%88%E6%95%B0%E5%AD%A6/"/>
<category term="推式子" scheme="http://WigginsLi.github.io/tags/%E6%8E%A8%E5%BC%8F%E5%AD%90/"/>
</entry>
<entry>
<title>欧拉定理初识与应用</title>
<link href="http://WigginsLi.github.io/2019/03/18/eulerdlksm/"/>
<id>http://WigginsLi.github.io/2019/03/18/eulerdlksm/</id>
<published>2019-03-18T12:58:28.000Z</published>
<updated>2019-05-27T12:52:16.813Z</updated>
<summary type="html">
<blockquote>
<p>上次打gzu校赛时碰到了一道大整数幂取模的题<br>赛后得知是欧拉定理，当场懵逼，赶紧补一下知识面</p>
</blockquote>
</summary>
<category term="数论" scheme="http://WigginsLi.github.io/categories/%E6%95%B0%E8%AE%BA/"/>
<category term="欧拉" scheme="http://WigginsLi.github.io/tags/%E6%AC%A7%E6%8B%89/"/>
<category term="快速幂" scheme="http://WigginsLi.github.io/tags/%E5%BF%AB%E9%80%9F%E5%B9%82/"/>
<category term="费马小定理" scheme="http://WigginsLi.github.io/tags/%E8%B4%B9%E9%A9%AC%E5%B0%8F%E5%AE%9A%E7%90%86/"/>
</entry>
<entry>
<title>USACO-Team Tic Tac Toe【暴力】</title>
<link href="http://WigginsLi.github.io/2019/03/16/rating-3-C/"/>
<id>http://WigginsLi.github.io/2019/03/16/rating-3-C/</id>
<published>2019-03-16T11:45:25.000Z</published>
<updated>2019-03-16T12:00:48.341Z</updated>
<summary type="html">
<p>$\implies$<a href="http://codeforces.com/group/NVaJtLaLjS/contest/238202/problem/C" target="_blank" rel="noopener">contest传送门</a><br>$\implies$<a href="http://www.usaco.org/index.php?page=viewproblem2&amp;cpid=831" target="_blank" rel="noopener">USACO传送门</a> </p>
<blockquote>
<p>考察细节</p>
</blockquote>
</summary>
<category term="Training" scheme="http://WigginsLi.github.io/categories/Training/"/>
<category term="暴力" scheme="http://WigginsLi.github.io/categories/%E6%9A%B4%E5%8A%9B/"/>
<category term="暴力" scheme="http://WigginsLi.github.io/tags/%E6%9A%B4%E5%8A%9B/"/>
</entry>
<entry>
<title>USACO18OPEN-Out of Sorts G【思维】</title>
<link href="http://WigginsLi.github.io/2019/03/16/rating-3-F/"/>
<id>http://WigginsLi.github.io/2019/03/16/rating-3-F/</id>
<published>2019-03-16T11:05:58.000Z</published>
<updated>2019-03-16T03:37:06.822Z</updated>
<summary type="html">
<p>$\implies$<a href="http://codeforces.com/group/NVaJtLaLjS/contest/238202/problem/F" target="_blank" rel="noopener">contest传送门</a><br>$\implies$<a href="https://www.luogu.org/problemnew/show/P4375" target="_blank" rel="noopener">洛谷传送门</a></p>
<blockquote>
<p>out of sort系列第二题</p>
</blockquote>
</summary>
<category term="Training" scheme="http://WigginsLi.github.io/categories/Training/"/>
<category term="思维" scheme="http://WigginsLi.github.io/categories/%E6%80%9D%E7%BB%B4/"/>
<category term="思维" scheme="http://WigginsLi.github.io/tags/%E6%80%9D%E7%BB%B4/"/>
</entry>
<entry>
<title>USACO18OPEN-Out of Sorts S【思维】</title>
<link href="http://WigginsLi.github.io/2019/03/16/rating-3-A/"/>
<id>http://WigginsLi.github.io/2019/03/16/rating-3-A/</id>
<published>2019-03-16T10:49:17.000Z</published>
<updated>2019-03-16T03:13:21.153Z</updated>
<summary type="html">
<p>$\implies$<a href="http://codeforces.com/group/NVaJtLaLjS/contest/238202/problem/A" target="_blank" rel="noopener">contest传送门</a><br>$\implies$<a href="https://www.luogu.org/problemnew/show/P4378" target="_blank" rel="noopener">洛谷传送门</a></p>
<blockquote>
<p>out of sort系列第一题</p>
</blockquote>
</summary>
<category term="Training" scheme="http://WigginsLi.github.io/categories/Training/"/>
<category term="思维" scheme="http://WigginsLi.github.io/categories/%E6%80%9D%E7%BB%B4/"/>
<category term="思维" scheme="http://WigginsLi.github.io/tags/%E6%80%9D%E7%BB%B4/"/>
</entry>
</feed>