-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
719 lines (427 loc) · 26.4 KB
/
index.html
File metadata and controls
719 lines (427 loc) · 26.4 KB
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
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
<!DOCTYPE html>
<html>
<head>
<meta name="baidu-site-verification" content="ZpQ2JgWydf" />
<meta charset="utf-8">
<title>
F-Mu's Blog</title>
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">
<meta property="og:type" content="website">
<meta property="og:title" content="F-Mu's Blog">
<meta property="og:url" content="https://yoursite.com/index.html">
<meta property="og:site_name" content="F-Mu's Blog">
<meta property="og:locale" content="zh-CN">
<meta name="twitter:card" content="summary">
<link rel="alternate" href="/atom.xml" title="F-Mu's Blog" type="application/atom+xml">
<link rel="icon" href="/images/default-avatar.jpg">
<link href="//fonts.googleapis.com/css?family=Source+Code+Pro" rel="stylesheet" type="text/css">
<link rel="stylesheet" href="/css/style.css">
<link rel="stylesheet" href="/css/highlight.css">
</head>
<body>
<div id="fullpage" class="mobile-nav-right">
<div id="wrapper" title="活着">
<header id="header">
<div id="nav-toggle" class="nav-toggle"></div>
<div class="head-box global-width">
<nav class="nav-box nav-right">
<a class="nav-item" href="/" title
>首页</a>
<a class="nav-item" href="/archives" title
>归档</a>
</nav>
</div>
</header>
<div id="middlecontent" title class="global-width sidebar-right">
<section id="main">
<article id="post-CodeForces-1332E-Height-All-the-Same" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/04/01/CodeForces-1332E-Height-All-the-Same/">CodeForces 1332E Height All the Same</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/04/01/CodeForces-1332E-Height-All-the-Same/" class="article-date">
<time datetime="2020-04-01T04:25:15.000Z" itemprop="datePublished">2020-04-01</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/%E6%95%B0%E8%AE%BA/">数论</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E6%95%B0%E8%AE%BA/" rel="tag">数论</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>对于一个$n*m$的矩阵，有两种操作</p>
<ul>
<li>一个格子加二</li>
<li>一个格子和另一个相邻的格子同时加一</li>
</ul>
<p>通过这两种操作最终使得所有矩阵元素相等</p>
<p>对于矩阵元素来说，有$L\leq a_{i,j}\leq R(1\leq i\leq n,1\leq j\leq m)$</p>
<p>问有多少种方案数，答案$\mod 998244353$</p>
<p class="article-more-link">
<a href="/2020/04/01/CodeForces-1332E-Height-All-the-Same/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-CodeForces-1332D-Walk-on-Matrix" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/04/01/CodeForces-1332D-Walk-on-Matrix/">CodeForces 1332D Walk on Matrix</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/04/01/CodeForces-1332D-Walk-on-Matrix/" class="article-date">
<time datetime="2020-04-01T02:30:02.000Z" itemprop="datePublished">2020-04-01</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/%E6%9E%84%E9%80%A0/">构造</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E6%9E%84%E9%80%A0/" rel="tag">构造</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>$Bob$想解决一个问题：一个$n*m$的矩阵，从$(1,1)$出发，只能走右和下，问从$(1,1)$到$(n,m)$的最大异或和</p>
<p>他的算法如下($C++$)</p>
<figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">memset</span>(dp, <span class="number">0</span>, <span class="keyword">sizeof</span>(dp));</span><br><span class="line">dp[<span class="number">0</span>][<span class="number">1</span>] = a[<span class="number">1</span>][<span class="number">1</span>];</span><br><span class="line"><span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">1</span>; i <= n; ++i) {</span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> j = <span class="number">1</span>; j <= m; ++j) {</span><br><span class="line"> dp[i][j] = max(dp[i - <span class="number">1</span>][j] & a[i][j], dp[i][j - <span class="number">1</span>] & a[i][j]);</span><br><span class="line"> }</span><br><span class="line">}</span><br><span class="line"><span class="built_in">cout</span> << dp[n][m];</span><br></pre></td></tr></table></figure>
<p>已知他的算法并不能得到最大的异或和</p>
<p>给定一个$k$，请构造出一个$n*m$的矩阵，使得最大异或和比他的代码得出的答案大$k$</p>
<p class="article-more-link">
<a href="/2020/04/01/CodeForces-1332D-Walk-on-Matrix/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-CodeForces-1322B-Present" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/18/CodeForces-1322B-Present/">CodeForces 1322B Present</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/03/18/CodeForces-1322B-Present/" class="article-date">
<time datetime="2020-03-18T10:15:14.000Z" itemprop="datePublished">2020-03-18</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/%E4%BA%8C%E8%BF%9B%E5%88%B6/">二进制</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E4%BA%8C%E8%BF%9B%E5%88%B6/" rel="tag">二进制</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>求对所有的二元组$(i,j)(i<j)$，$a_i+a_j$的异或和</p>
<p class="article-more-link">
<a href="/2020/03/18/CodeForces-1322B-Present/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-交并比" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/17/%E4%BA%A4%E5%B9%B6%E6%AF%94/">交并比</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/03/17/%E4%BA%A4%E5%B9%B6%E6%AF%94/" class="article-date">
<time datetime="2020-03-17T05:08:46.000Z" itemprop="datePublished">2020-03-17</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/DL/">DL</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/DL/" rel="tag">DL</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p>交并比（ $IoU$ ）函数做的是计算两个边界框交集和并集之比。两个边界框的并集是这个区域，就是属于包含两个边界框区域（绿色阴影表示区域），而交集就是这个比较小的区域（橙色阴影表示区域），那么交并比就是交集的大小，这个橙色阴影面积，然后除以绿色阴影的并集面积。</p>
<p class="article-more-link">
<a href="/2020/03/17/%E4%BA%A4%E5%B9%B6%E6%AF%94/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-字符编码" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/15/%E5%AD%97%E7%AC%A6%E7%BC%96%E7%A0%81/">字符编码</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/03/15/%E5%AD%97%E7%AC%A6%E7%BC%96%E7%A0%81/" class="article-date">
<time datetime="2020-03-15T05:03:55.000Z" itemprop="datePublished">2020-03-15</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/Java/">Java</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/Java/" rel="tag">Java</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p>$ASCII$编码采用$1 Byte$，最多$256$个字符</p>
<p>扩展编码（加字节）</p>
<p class="article-more-link">
<a href="/2020/03/15/%E5%AD%97%E7%AC%A6%E7%BC%96%E7%A0%81/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-CodeForces-1324F-Maximum-White-Subtree" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/13/CodeForces-1324F-Maximum-White-Subtree/">CodeForces 1324F Maximum White Subtree</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/03/13/CodeForces-1324F-Maximum-White-Subtree/" class="article-date">
<time datetime="2020-03-13T03:35:19.000Z" itemprop="datePublished">2020-03-13</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/DP-%E6%A0%91/">DP,树</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/DP/" rel="tag">DP</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>给定一棵$n$个节点的无根树，每个节点为黑色或者白色，每个点的答案为包含该点的子树（指无根子树）的白色节点数减黑色节点数的最大值</p>
<p class="article-more-link">
<a href="/2020/03/13/CodeForces-1324F-Maximum-White-Subtree/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-CodeForces-1324E-Sleeping-Schedule" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/13/CodeForces-1324E-Sleeping-Schedule/">CodeForces 1324E Sleeping Schedule</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/03/13/CodeForces-1324E-Sleeping-Schedule/" class="article-date">
<time datetime="2020-03-13T02:30:19.000Z" itemprop="datePublished">2020-03-13</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/DP/">DP</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/DP/" rel="tag">DP</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>$Vova$有一个睡眠时间表，一天有$h$小时，$Vova$会睡$n$次觉，一次睡一天，在第$i-1$次睡醒后，$Vova$在$a_i$或$a_i-1$个小时候可以再次入睡，一开始时间为第$0$时（可以视作$Vova$刚醒），$Vova$在$[l,r]$区间时睡觉会睡得舒服，问$Vova$最多可以睡几次舒服觉</p>
<p class="article-more-link">
<a href="/2020/03/13/CodeForces-1324E-Sleeping-Schedule/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-CodeForces-1324D-Pair-of-Topics" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/13/CodeForces-1324D-Pair-of-Topics/">CodeForces 1324D Pair of Topics</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/03/13/CodeForces-1324D-Pair-of-Topics/" class="article-date">
<time datetime="2020-03-13T01:36:54.000Z" itemprop="datePublished">2020-03-13</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/%E4%BA%8C%E5%88%86/">二分</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E4%BA%8C%E5%88%86/" rel="tag">二分</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>对于两个长度为$n$的数组$a[]$和$b[]$，找到有多少对$i$和$j(i<j)$，满足$a_i+a_j>b_i+b_j$</p>
<p class="article-more-link">
<a href="/2020/03/13/CodeForces-1324D-Pair-of-Topics/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-ICPC-Japan-2018-Floating-Point-Numbers" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/01/27/ICPC-Japan-2018-Floating-Point-Numbers/">[ICPC Japan 2018] Floating-Point Numbers</a>
</h1>
</header>
<div class="article-meta">
<a href="/2020/01/27/ICPC-Japan-2018-Floating-Point-Numbers/" class="article-date">
<time datetime="2020-01-27T05:36:57.000Z" itemprop="datePublished">2020-01-27</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/%E4%BA%8C%E8%BF%9B%E5%88%B6/">二进制</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E4%BA%8C%E8%BF%9B%E5%88%B6/" rel="tag">二进制</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E6%A8%A1%E6%8B%9F/" rel="tag">模拟</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>给出$64$位二进制浮点数的表示方式，其中前$12$是指数，后$52$位是小数部分，整数部分默认为$1$，给出整数$n$，和按该表示方法给出的浮点数$a$的小数部分（后$52$位），输出$a$在该表示方法下连续加和$n$次（即$n+1$个$a$依次相加）的$64$位二进制浮点数的表示。</p>
<p class="article-more-link">
<a href="/2020/01/27/ICPC-Japan-2018-Floating-Point-Numbers/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<article id="post-CodeForces-1278B-A-and-B" class="article global-container article-type-post" itemscope itemprop="blogPost">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2019/12/20/CodeForces-1278B-A-and-B/">CodeForces-1278B-A and B</a>
</h1>
</header>
<div class="article-meta">
<a href="/2019/12/20/CodeForces-1278B-A-and-B/" class="article-date">
<time datetime="2019-12-20T03:13:37.000Z" itemprop="datePublished">2019-12-20</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/%E6%80%9D%E7%BB%B4/">思维</a>
</div>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E6%80%9D%E7%BB%B4/" rel="tag">思维</a></li></ul>
</div>
<div class="article-inner">
<div class="article-content article-content-cloud" itemprop="articleBody">
<p><strong>题意</strong></p>
<p>对于$t(1\leq t\leq 100)$个测试点，给两个数$a$和$b$，作如下操作：</p>
<p>第一次挑一个数使其加$1$，第二次挑一个数使其加$2$，以此类推，最后两个数相等，问最小操作数。</p>
<p class="article-more-link">
<a href="/2019/12/20/CodeForces-1278B-A-and-B/#more">阅读全文</a>
</p>
</div>
</div>
</article>
<nav id="page-nav">
<span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><a class="extend next" rel="next" href="/page/2/">下一页 &raquo;</a>
</nav>
</section>
<aside id="sidebar">
<div class="widget-box">
<div class="avatar-box">
<img class="avatar" src="/images/default-avatar.jpg" title="头像来自网络"></img>
<h3 class="avatar-name">
幕
</h3>
<p class="avatar-slogan">
</p>
</div>
</div>
<div class="widget-box">
<h3 class="widget-title">分类</h3>
<div class="widget">
<ul class="category-list"><li class="category-list-item"><a class="category-list-link" href="/categories/DL/">DL</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/DP/">DP</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/DP-%E6%A0%91/">DP,树</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/Java/">Java</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E4%BA%8C%E5%88%86/">二分</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E4%BA%8C%E8%BF%9B%E5%88%B6/">二进制</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E6%80%9D%E7%BB%B4/">思维</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E6%84%9F%E6%82%9F/">感悟</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E6%95%B0%E8%AE%BA/">数论</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E6%9E%84%E9%80%A0/">构造</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/%E6%A8%A1%E6%8B%9F/">模拟</a></li></ul>
</div>
</div>
<div class="widget-box">
<h3 class="widget-title">标签</h3>
<div class="widget">
<ul class="tag-list" itemprop="keywords"><li class="tag-list-item"><a class="tag-list-link" href="/tags/DL/" rel="tag">DL</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/DP/" rel="tag">DP</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/Java/" rel="tag">Java</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E4%BA%8C%E5%88%86/" rel="tag">二分</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E4%BA%8C%E8%BF%9B%E5%88%B6/" rel="tag">二进制</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E5%89%8D%E7%BC%80/" rel="tag">前缀</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E5%90%8E%E7%BC%80/" rel="tag">后缀</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E6%80%9D%E7%BB%B4/" rel="tag">思维</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E6%8E%92%E5%BA%8F/" rel="tag">排序</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E6%95%B0%E8%AE%BA/" rel="tag">数论</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E6%9E%84%E9%80%A0/" rel="tag">构造</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E6%A0%91/" rel="tag">树</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E6%A8%A1%E6%8B%9F/" rel="tag">模拟</a></li></ul>
</div>
</div>
<div class="widget-box">
<h3 class="widget-title">标签云</h3>
<div class="widget tagcloud">
<a href="/tags/DL/" style="font-size: 10px;">DL</a> <a href="/tags/DP/" style="font-size: 20px;">DP</a> <a href="/tags/Java/" style="font-size: 10px;">Java</a> <a href="/tags/%E4%BA%8C%E5%88%86/" style="font-size: 13.33px;">二分</a> <a href="/tags/%E4%BA%8C%E8%BF%9B%E5%88%B6/" style="font-size: 16.67px;">二进制</a> <a href="/tags/%E5%89%8D%E7%BC%80/" style="font-size: 10px;">前缀</a> <a href="/tags/%E5%90%8E%E7%BC%80/" style="font-size: 13.33px;">后缀</a> <a href="/tags/%E6%80%9D%E7%BB%B4/" style="font-size: 13.33px;">思维</a> <a href="/tags/%E6%8E%92%E5%BA%8F/" style="font-size: 10px;">排序</a> <a href="/tags/%E6%95%B0%E8%AE%BA/" style="font-size: 10px;">数论</a> <a href="/tags/%E6%9E%84%E9%80%A0/" style="font-size: 10px;">构造</a> <a href="/tags/%E6%A0%91/" style="font-size: 10px;">树</a> <a href="/tags/%E6%A8%A1%E6%8B%9F/" style="font-size: 20px;">模拟</a>
</div>
</div>
<div class="widget-box">
<h3 class="widget-title">归档</h3>
<div class="widget">
<ul class="archive-list"><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/04/">四月 2020</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/03/">三月 2020</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/01/">一月 2020</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2019/12/">十二月 2019</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2019/11/">十一月 2019</a></li></ul>
</div>
</div>
<div class="widget-box">
<h3 class="widget-title">最新文章</h3>
<div class="widget">
<ul>
<li>
<a href="/2020/04/01/CodeForces-1332E-Height-All-the-Same/">CodeForces 1332E Height All the Same</a>
</li>
<li>
<a href="/2020/04/01/CodeForces-1332D-Walk-on-Matrix/">CodeForces 1332D Walk on Matrix</a>
</li>
<li>
<a href="/2020/03/18/CodeForces-1322B-Present/">CodeForces 1322B Present</a>
</li>
<li>
<a href="/2020/03/17/%E4%BA%A4%E5%B9%B6%E6%AF%94/">交并比</a>
</li>
<li>
<a href="/2020/03/15/%E5%AD%97%E7%AC%A6%E7%BC%96%E7%A0%81/">字符编码</a>
</li>
</ul>
</div>
</div>
<div class="widget-box">
<h3 class="widget-title">友链</h3>
<div class="widget">
<a style="display: block;" href="https://yuanquanquan.top/" title target='_blank'
>努力学长</a>
</div>
</div>
</aside>
</div>
<footer id="footer">
<div class="foot-box global-width">
© 2020 F-Mu
驱动于 <a href="https://hexo.io/" target="_blank">Hexo</a>
| 主题 <a href="https://github.com/yiluyanxia/hexo-theme-antiquity" target="_blank" rel="noopener">antiquity</a>
<br>
<script async src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script>
<span id="busuanzi_container_site_pv">不蒜子告之 阁下是第<span id="busuanzi_value_site_pv"></span>个访客</span>
</div>
<script>
(function(){
var bp = document.createElement('script');
var curProtocol = window.location.protocol.split(':')[0];
if (curProtocol === 'https') {
bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
}
else {
bp.src = 'http://push.zhanzhang.baidu.com/push.js';
}
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(bp, s);
})();
</script>
</footer>
<script src="https://code.jquery.com/jquery-2.0.3.min.js"></script>
<script>
if (!window.jQuery) {
var script = document.createElement('script');
script.src = "/js/jquery-2.0.3.min.js";
document.body.write(script);
}
</script>
<link rel="stylesheet" href="/fancybox/jquery.fancybox.css">
<script src="/fancybox/jquery.fancybox.pack.js"></script>
<script src="/js/script.js"></script>
</div>
<nav id="mobile-nav" class="mobile-nav-box">
<div class="mobile-nav-img mobile-nav-top"></div>
<a href="/" class="mobile-nav-link">首页</a>
<a href="/archives" class="mobile-nav-link">归档</a>
<div class="mobile-nav-img mobile-nav-bottom"></div>
</nav>
</div>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
inlineMath: [ ["$","$"], ["\\(","\\)"] ],
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre', 'code'],
processEscapes: true
}
});
MathJax.Hub.Queue(function() {
var all = MathJax.Hub.getAllJax();
for (var i = 0; i < all.length; ++i)
all[i].SourceElement().parentNode.className += ' has-jax';
});
</script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-MML-AM_CHTML"></script>
<script src="/live2dw/lib/L2Dwidget.min.js?094cbace49a39548bed64abff5988b05"></script><script>L2Dwidget.init({"model":{"jsonPath":"/live2dw/assets/z16.model.json"},"display":{"position":"right","width":150,"height":300},"mobile":{"show":true},"log":false,"pluginJsPath":"lib/","pluginModelPath":"assets/","pluginRootPath":"live2dw/","tagMode":false});</script></body>
</html>