-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
675 lines (397 loc) · 75.5 KB
/
index.html
File metadata and controls
675 lines (397 loc) · 75.5 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
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>Hexo</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="Hexo">
<meta property="og:url" content="http://yoursite.com/index.html">
<meta property="og:site_name" content="Hexo">
<meta property="og:locale" content="en_US">
<meta property="article:author" content="John Doe">
<meta name="twitter:card" content="summary">
<link rel="alternate" href="/atom.xml" title="Hexo" type="application/atom+xml">
<link rel="icon" href="/favicon.png">
<link href="//fonts.googleapis.com/css?family=Source+Code+Pro" rel="stylesheet" type="text/css">
<link rel="stylesheet" href="/css/style.css">
<meta name="generator" content="Hexo 4.2.0"></head>
<body>
<div id="container">
<div id="wrap">
<header id="header">
<div id="banner"></div>
<div id="header-outer" class="outer">
<div id="header-title" class="inner">
<h1 id="logo-wrap">
<a href="/" id="logo">Hexo</a>
</h1>
</div>
<div id="header-inner" class="inner">
<nav id="main-nav">
<a id="main-nav-toggle" class="nav-icon"></a>
<a class="main-nav-link" href="/">Home</a>
<a class="main-nav-link" href="/archives">Archives</a>
</nav>
<nav id="sub-nav">
<a id="nav-rss-link" class="nav-icon" href="/atom.xml" title="RSS Feed"></a>
<a id="nav-search-btn" class="nav-icon" title="Search"></a>
</nav>
<div id="search-form-wrap">
<form action="//google.com/search" method="get" accept-charset="UTF-8" class="search-form"><input type="search" name="q" class="search-form-input" placeholder="Search"><button type="submit" class="search-form-submit"></button><input type="hidden" name="sitesearch" value="http://yoursite.com"></form>
</div>
</div>
</div>
</header>
<div class="outer">
<section id="main">
<article id="post-站队" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/10/%E7%AB%99%E9%98%9F/" class="article-date">
<time datetime="2020-03-09T16:31:05.000Z" itemprop="datePublished">2020-03-10</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/10/%E7%AB%99%E9%98%9F/">站队</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="试题F：站队-15’"><a href="#试题F：站队-15’" class="headerlink" title="试题F：站队 15’"></a>试题F：站队 15’</h1><p>九月份新生入学，学校安排了为期1414天的军训。现在要求对N名同学进行排队。规则如下:</p>
<ul>
<li>所有同学由身高从小到大排序</li>
<li>相同身高的同学按年龄(出生到当前时间的天数)由小到大进行排序</li>
<li>若前两项均相同，按编号由小到大进行排序</li>
</ul>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行读入一个正整数N<br>接下来2至N+12至N+1行，每行读入两个正整数H,D(H表示学生身高，D表示学生由出生到当前时间的天数)，学生的编号按读入数据顺序正序表示</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>输出经过排序后学生的编号位置</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入-1"><a href="#输入-1" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">3</span><br><span class="line">175 7100</span><br><span class="line">158 7050</span><br><span class="line">180 7000</span><br></pre></td></tr></table></figure>
<h4 id="输出-1"><a href="#输出-1" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">2 1 3</span><br></pre></td></tr></table></figure>
<p>题解如下：</p>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="class"><span class="keyword">struct</span> <span class="title">Student</span>{</span></span><br><span class="line"> <span class="keyword">int</span> h,y,id;</span><br><span class="line">};</span><br><span class="line">Student st[<span class="number">1000005</span>];</span><br><span class="line"><span class="function"><span class="keyword">bool</span> <span class="title">cmp</span><span class="params">(Student A,Student B)</span></span>{</span><br><span class="line"> <span class="keyword">if</span>(A.h<B.h)</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">true</span>;</span><br><span class="line"> <span class="keyword">if</span>(A.h>B.h)</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">false</span>;</span><br><span class="line"> <span class="keyword">if</span>(A.y<B.y)</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">true</span>;</span><br><span class="line"> <span class="keyword">if</span>(A.y>B.y)</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">false</span>;</span><br><span class="line"> <span class="keyword">if</span>(A.id<B.id)</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">true</span>;</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">false</span>;</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="keyword">int</span> n;</span><br><span class="line"> <span class="built_in">cin</span>>>n;</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"> st[i].id=i;</span><br><span class="line"> <span class="built_in">cin</span>>>st[i].h>>st[i].y;</span><br><span class="line"> }</span><br><span class="line"> sort(st+<span class="number">1</span>,st+<span class="number">1</span>+n,cmp);</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="built_in">cout</span><<st[i].id<<<span class="string">" "</span>;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/10/%E7%AB%99%E9%98%9F/" data-id="ck7qewnw2000c0oh40hr65hx7" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E6%8E%92%E5%BA%8F/" rel="tag">排序</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E7%BB%93%E6%9E%84%E4%BD%93/" rel="tag">结构体</a></li></ul>
</footer>
</div>
</article>
<article id="post-切香肠" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/10/%E5%88%87%E9%A6%99%E8%82%A0/" class="article-date">
<time datetime="2020-03-09T16:25:19.000Z" itemprop="datePublished">2020-03-10</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/10/%E5%88%87%E9%A6%99%E8%82%A0/">切香肠</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="试题I：切香肠-25’"><a href="#试题I：切香肠-25’" class="headerlink" title="试题I：切香肠 25’"></a>试题I：切香肠 25’</h1><p>窗外肉价飞涨，屋里灶台微响。便当店老板在沉思中苦恼:<br>现在店里的存货还有n<em>n</em>条特制香肠，长度分别为L_i<em>L*</em>i<em>。如果能从它们中切割出k</em>k<em>条长度相同的香肠的话，就能应付突如其来的奇怪的订单<br>你能帮这位老板计算一下这k</em>k*条香肠每条最长能有多长吗?<br>(答案保留小数点后两位，规定11单位长度的香肠最多可以切割成100100份)</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行输入22个正整数n, k<em>n</em>,<em>k</em><br>第2-(n+1)2−(<em>n</em>+1)行每行输入一个实数L(1.0≤L_i≤1.0 * 10^5)<em>L</em>(1.0≤<em>L*</em>i*≤1.0∗105) </p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>输出切出来的香肠的最大长度，结果保留两位小数</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入复制"><a href="#输入复制" class="headerlink" title="输入复制"></a>输入复制</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">4 11</span><br><span class="line">8.02</span><br><span class="line">7.43</span><br><span class="line">4.57</span><br><span class="line">5.39</span><br></pre></td></tr></table></figure>
<h4 id="输出复制"><a href="#输出复制" class="headerlink" title="输出复制"></a>输出复制</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">2.00</span><br></pre></td></tr></table></figure>
<p>题解如下：</p>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">int</span> d[<span class="number">10000</span>];</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="keyword">int</span> n,k;</span><br><span class="line"> <span class="built_in">cin</span>>>n>>k;</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">0</span>;i<n;i++){</span><br><span class="line"> <span class="keyword">double</span> num;</span><br><span class="line"> <span class="built_in">scanf</span>(<span class="string">"%lf"</span>,&num);</span><br><span class="line"> d[i]=num*<span class="number">100</span>;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">int</span> l,r;</span><br><span class="line"> l=<span class="number">1</span>,r=<span class="number">10000000</span>;</span><br><span class="line"> <span class="keyword">int</span> m=<span class="number">0</span>;</span><br><span class="line"> <span class="keyword">int</span> mid=(l+r)/<span class="number">2</span>;</span><br><span class="line"> <span class="keyword">while</span>(l<r&&r-l!=<span class="number">1</span>){</span><br><span class="line"> <span class="keyword">int</span> num=<span class="number">0</span>;</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">0</span>;i<n;i++){</span><br><span class="line"> num+=<span class="number">1.0</span>*d[i]/mid;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">if</span>(num>=k){</span><br><span class="line"> l=mid;</span><br><span class="line"> m=<span class="built_in">max</span>(mid,m);</span><br><span class="line"> mid=(l+r)/<span class="number">2</span>;</span><br><span class="line"> }<span class="keyword">else</span>{</span><br><span class="line"> r=mid;</span><br><span class="line"> mid=(l+r)/<span class="number">2</span>;</span><br><span class="line"> }</span><br><span class="line"> <span class="comment">//cout<<l<<" "<<mid<<" "<<r<<endl;</span></span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">double</span> ans=m/<span class="number">100.0</span>;</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"%.2f"</span>,ans);</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/10/%E5%88%87%E9%A6%99%E8%82%A0/" data-id="ck7qewnvv00050oh4fmspgybt" class="article-share-link">Share</a>
<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>
</footer>
</div>
</article>
<article id="post-完全背包" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/06/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85/" class="article-date">
<time datetime="2020-03-06T14:54:49.000Z" itemprop="datePublished">2020-03-06</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/06/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85/">完全背包</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="完全背包"><a href="#完全背包" class="headerlink" title="完全背包"></a>完全背包</h1><p>有 N<em>N</em> 种物品和一个容量为 V<em>V</em> 的背包。第i<em>i</em>种物品的体积是 C_i，得到的价值是 W_i。求解将哪些物品装入背包可使价值总和最大,每种物品有无数件。</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行是两个整数N和V(1<=N,V<=1000)<em>V</em>(1<=<em>N</em>,<em>V</em><=1000)。 </p>
<p>接下来N行，每行有两个数C_i和W_i(1<=C_i,W_i<=1000)W_i(1<=C_i,W_i<=1000)，分别代表体积和价值。</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>输出能得到的最大价值。</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入-1"><a href="#输入-1" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">5 10</span><br><span class="line">1 5</span><br><span class="line">2 4</span><br><span class="line">3 3</span><br><span class="line">4 2</span><br><span class="line">5 1</span><br></pre></td></tr></table></figure>
<h4 id="输出-1"><a href="#输出-1" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">50</span><br></pre></td></tr></table></figure>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> MAXN=<span class="number">1005</span>;</span><br><span class="line"><span class="keyword">int</span> w[MAXN],v[MAXN];<span class="comment">//w重量，v价值</span></span><br><span class="line"><span class="keyword">int</span> f[MAXN];</span><br><span class="line"><span class="keyword">int</span> n,m;</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="built_in">cin</span>>>n>>m;</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="built_in">cin</span>>>w[i]>>v[i];</span><br><span class="line"> }</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=w[i];j<=m;j++){</span><br><span class="line"> f[j]= <span class="built_in">max</span>(f[j],f[j-w[i]]+v[i]);</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">cout</span><<f[m];</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/06/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85/" data-id="ck7qewnw5000e0oh44ycy3st0" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" rel="tag">动态规划</a></li></ul>
</footer>
</div>
</article>
<article id="post-线段树" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/04/%E7%BA%BF%E6%AE%B5%E6%A0%91/" class="article-date">
<time datetime="2020-03-04T14:44:24.000Z" itemprop="datePublished">2020-03-04</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/04/%E7%BA%BF%E6%AE%B5%E6%A0%91/">线段树</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<p>线段树可以解决区间加法，求单点查值或单点加法，求区间和问题问题</p>
<h1 id="分块"><a href="#分块" class="headerlink" title="分块"></a>分块</h1><p>给出一个长为n的数列，以及n操作，操作涉及区间加法，单点查值。</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行输入一个数字n。</p>
<p>第二行输入n个数字，第i个数字为ai，以空格隔开。</p>
<p>接下来输入n行询问，每行输入四个数字opt、l、r、c，以空格隔开。</p>
<p>若opt = 0，表示将位于[l,r]的之间的数字都加c。</p>
<p>若opt = 1，表示询问ar的值（l和c忽略）。</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>对于每次询问，输出一行一个数字表示答案。</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入-1"><a href="#输入-1" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">4</span><br><span class="line">1 2 2 3</span><br><span class="line">0 1 3 1</span><br><span class="line">1 0 1 0</span><br><span class="line">0 1 2 2</span><br><span class="line">1 0 2 0</span><br></pre></td></tr></table></figure>
<h4 id="输出-1"><a href="#输出-1" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">2</span><br><span class="line">5</span><br></pre></td></tr></table></figure>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><iostream></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">int</span> d[<span class="number">50005</span>];</span><br><span class="line"><span class="keyword">int</span> n;</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">add</span><span class="params">(<span class="keyword">int</span> pos,<span class="keyword">int</span> v)</span></span>{</span><br><span class="line"> <span class="keyword">while</span>(pos<=n){</span><br><span class="line"> d[pos]+=v;</span><br><span class="line"> pos+=(pos&-pos); </span><br><span class="line"> }</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">query</span><span class="params">(<span class="keyword">int</span> pos)</span></span>{</span><br><span class="line"> <span class="keyword">int</span> res=<span class="number">0</span>;</span><br><span class="line"> <span class="keyword">while</span>(pos){</span><br><span class="line"> res+=d[pos];</span><br><span class="line"> pos-=(pos&-pos);</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">return</span> res;</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="built_in">cin</span>>>n;</span><br><span class="line"> <span class="keyword">int</span> num,opt,l,r,c;</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="built_in">cin</span>>>num;</span><br><span class="line"> add(i,num);</span><br><span class="line"> add(i+<span class="number">1</span>,-num);</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">0</span>;i<n;i++){</span><br><span class="line"> <span class="built_in">cin</span>>>opt>>l>>r>>c;</span><br><span class="line"> <span class="keyword">if</span>(opt){</span><br><span class="line"> <span class="built_in">cout</span><<query(r)<<<span class="built_in">endl</span>;</span><br><span class="line"> }<span class="keyword">else</span>{</span><br><span class="line"> add(l,c);</span><br><span class="line"> add(r+<span class="number">1</span>,-c);</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/04/%E7%BA%BF%E6%AE%B5%E6%A0%91/" data-id="ck7qewnxf000v0oh4bpt54i5r" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/" rel="tag">数据结构</a></li></ul>
</footer>
</div>
</article>
<article id="post-二维迷宫" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/04/%E4%BA%8C%E7%BB%B4%E8%BF%B7%E5%AE%AB/" class="article-date">
<time datetime="2020-03-03T16:22:30.000Z" itemprop="datePublished">2020-03-04</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/04/%E4%BA%8C%E7%BB%B4%E8%BF%B7%E5%AE%AB/">二维迷宫</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="二维迷宫"><a href="#二维迷宫" class="headerlink" title="二维迷宫"></a>二维迷宫</h1><p>给你一个 n<em>n</em> 行 m<em>m</em> 列 的迷宫，迷宫的每一个格子可能是是路，也有可能是墙。我们只能走到路上而不能走到墙上。</p>
<p>现在你需要判断是否存在可行的方案，从二维迷宫中左上角的格子走到右下角。</p>
<p>说明：如果你当前在二维迷宫中的某一个点，你能够走到的点仅仅只有当前点上下左右四个点中在迷宫中的可走的路。</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>输入的第一行包含两个整数 n<em>n</em> 和 m<em>m</em> ，分别表示迷宫的行数和列数。</p>
<p>接下来 n<em>n</em> 行，每行包含一个长度为 m<em>m</em> 的字符串，用于表示这个二维迷宫。</p>
<p>对于二维迷宫中的每一个点，我们用“.”表示可走的路，用“#”表示不可走的墙。</p>
<p>数据保证左上角的起点（即第11行第11个点）和右下角的终点（即第n<em>n</em>行第m<em>m</em>个点）都是可走的路。</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>如果从左上角到右下角存在可行的路，输出“YES”；否则，输出“NO”。</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入复制"><a href="#输入复制" class="headerlink" title="输入复制"></a>输入复制</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">4 5</span><br><span class="line">..###</span><br><span class="line">#....</span><br><span class="line">####.</span><br><span class="line">####.</span><br></pre></td></tr></table></figure>
<h4 id="输出复制"><a href="#输出复制" class="headerlink" title="输出复制"></a>输出复制</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">YES</span><br></pre></td></tr></table></figure>
<h4 id="输入复制-1"><a href="#输入复制-1" class="headerlink" title="输入复制"></a>输入复制</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">4 5</span><br><span class="line">.....</span><br><span class="line">.####</span><br><span class="line">...#.</span><br><span class="line">###..</span><br></pre></td></tr></table></figure>
<h4 id="输出复制-1"><a href="#输出复制-1" class="headerlink" title="输出复制"></a>输出复制</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">NO</span><br></pre></td></tr></table></figure>
<p>题解如下：</p>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">char</span> Map[<span class="number">1005</span>][<span class="number">1005</span>];</span><br><span class="line"><span class="keyword">int</span> n,m;</span><br><span class="line"><span class="keyword">bool</span> flag=<span class="literal">false</span>;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">f</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> y)</span></span>{</span><br><span class="line"> <span class="keyword">if</span>(x==n&&y==m){</span><br><span class="line"> flag=<span class="literal">true</span>;<span class="comment">//出口</span></span><br><span class="line"> <span class="keyword">return</span> ;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">if</span>(Map[x][y]==<span class="string">'#'</span>)</span><br><span class="line"> <span class="keyword">return</span> ;</span><br><span class="line"> Map[x][y]=<span class="string">'#'</span>;</span><br><span class="line"> <span class="keyword">if</span>(x><span class="number">1</span>&&Map[x<span class="number">-1</span>][y]!=<span class="string">'#'</span>)</span><br><span class="line"> f(x<span class="number">-1</span>,y);</span><br><span class="line"> <span class="keyword">if</span>(x!=n&&Map[x+<span class="number">1</span>][y]!=<span class="string">'#'</span>)</span><br><span class="line"> f(x+<span class="number">1</span>,y);</span><br><span class="line"> <span class="keyword">if</span>(y><span class="number">1</span>&&Map[x][y<span class="number">-1</span>]!=<span class="string">'#'</span>)</span><br><span class="line"> f(x,y<span class="number">-1</span>);</span><br><span class="line"> <span class="keyword">if</span>(y!=m&&Map[x][y+<span class="number">1</span>]!=<span class="string">'#'</span>)</span><br><span class="line"> f(x,y+<span class="number">1</span>);</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="built_in">cin</span>>>n>>m;</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"> getchar();</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"> Map[i][j]=getchar();</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> </span><br><span class="line"> f(<span class="number">1</span>,<span class="number">1</span>);</span><br><span class="line"> <span class="keyword">if</span>(flag){</span><br><span class="line"> <span class="built_in">cout</span><<<span class="string">"YES"</span>;</span><br><span class="line"> }<span class="keyword">else</span>{</span><br><span class="line"> <span class="built_in">cout</span><<<span class="string">"NO"</span>;</span><br><span class="line"> }</span><br><span class="line"></span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/04/%E4%BA%8C%E7%BB%B4%E8%BF%B7%E5%AE%AB/" data-id="ck7qewnvs00030oh4294m61dp" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/dfs/" rel="tag">dfs</a></li></ul>
</footer>
</div>
</article>
<article id="post-填算式" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/03/%E5%A1%AB%E7%AE%97%E5%BC%8F/" class="article-date">
<time datetime="2020-03-02T16:20:33.000Z" itemprop="datePublished">2020-03-03</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/03/%E5%A1%AB%E7%AE%97%E5%BC%8F/">填算式</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="试题A：填算式"><a href="#试题A：填算式" class="headerlink" title="试题A：填算式"></a>试题A：填算式</h1><p>请看下面的算式： </p>
<p>(ABCD - EFGH) * XY = 900<br>每个字母代表一个0~9的数字，不同字母代表不同数字，首位不能为0。 </p>
<p>比如，(5012 - 4987) * 36 就是一个解。 </p>
<p>请找到另一个解，并提交该解中 ABCD 所代表的整数。 </p>
<p>请严格按照格式，通过浏览器提交答案。<br>注意：只提交 ABCD 所代表的整数，不要写其它附加内容，比如：说明性的文字。</p>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">int</span> d[<span class="number">10</span>];</span><br><span class="line"><span class="keyword">bool</span> vis[<span class="number">10</span>];</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">zs</span><span class="params">(<span class="keyword">int</span> a,<span class="keyword">int</span> b,<span class="keyword">int</span> c,<span class="keyword">int</span> e)</span></span>{</span><br><span class="line"> <span class="keyword">return</span> d[a]*<span class="number">1000</span>+d[b]*<span class="number">100</span>+d[c]*<span class="number">10</span>+d[e];</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">zs</span><span class="params">(<span class="keyword">int</span> a,<span class="keyword">int</span> b)</span></span>{</span><br><span class="line"> <span class="keyword">return</span> d[a]*<span class="number">10</span>+d[b];</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">dfs</span><span class="params">(<span class="keyword">int</span> <span class="built_in">step</span>)</span></span>{</span><br><span class="line"> <span class="keyword">if</span>(<span class="built_in">step</span>==<span class="number">10</span>){</span><br><span class="line"> <span class="keyword">if</span>(d[<span class="number">0</span>]==<span class="number">0</span>||d[<span class="number">4</span>]==<span class="number">0</span>||d[<span class="number">8</span>]==<span class="number">0</span>)</span><br><span class="line"> <span class="keyword">return</span> ;</span><br><span class="line"> <span class="keyword">int</span> a=zs(<span class="number">0</span>,<span class="number">1</span>,<span class="number">2</span>,<span class="number">3</span>);</span><br><span class="line"> <span class="keyword">int</span> b=zs(<span class="number">4</span>,<span class="number">5</span>,<span class="number">6</span>,<span class="number">7</span>);</span><br><span class="line"> <span class="keyword">int</span> c=zs(<span class="number">8</span>,<span class="number">9</span>);</span><br><span class="line"> <span class="keyword">if</span>((a-b)*c==<span class="number">900</span>){</span><br><span class="line"> <span class="keyword">if</span>(a!=<span class="number">5012</span>)</span><br><span class="line"> <span class="built_in">cout</span><<a;</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">0</span>;i<<span class="number">10</span>;i++){</span><br><span class="line"> <span class="keyword">if</span>(!vis[i]){</span><br><span class="line"> vis[i]=<span class="literal">true</span>;</span><br><span class="line"> d[<span class="built_in">step</span>]=i;</span><br><span class="line"> dfs(<span class="built_in">step</span>+<span class="number">1</span>);</span><br><span class="line"> vis[i]=<span class="literal">false</span>;</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> dfs(<span class="number">0</span>);</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/03/%E5%A1%AB%E7%AE%97%E5%BC%8F/" data-id="ck7qewnw000090oh4eq3dciqf" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/dfs/" rel="tag">dfs</a></li></ul>
</footer>
</div>
</article>
<article id="post-多重背包" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/02/%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85/" class="article-date">
<time datetime="2020-03-02T14:54:30.000Z" itemprop="datePublished">2020-03-02</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/02/%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85/">多重背包</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="多重背包"><a href="#多重背包" class="headerlink" title="多重背包"></a>多重背包</h1><p>有 N<em>N</em>种物品和一个容量为 V<em>V</em> 的背包。第i<em>i</em>种物品的体积是 C_i<em>C**i</em> ，得到的价值是 W_i<em>W*</em>i<em>，以及它最多只能被取M_i</em>M*<em>i</em>件。求解将哪些物品装入背包可使价值总和最大。</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行是两个整数N<em>N</em>和V(1<=N,V<=5000)<em>V</em>(1<=<em>N</em>,<em>V</em><=5000)。 </p>
<p>接下来N<em>N</em>行，每行有三个数C_i<em>C<strong>i<em>和W_i</em>W</strong>i<em>和M_i(0<=C_i,W_i,M_i<=5000)</em>M**i</em>(0<=<em>C**i</em>,<em>W**i</em>,<em>M**i</em><=5000)，分别代表体积和价值和件数。</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>输出能得到的最大价值。</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入-1"><a href="#输入-1" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">5 10</span><br><span class="line">1 5 1</span><br><span class="line">2 4 2</span><br><span class="line">3 3 3</span><br><span class="line">4 2 4</span><br><span class="line">5 1 5</span><br></pre></td></tr></table></figure>
<h4 id="输出-1"><a href="#输出-1" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">16</span><br></pre></td></tr></table></figure>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> MAXN=<span class="number">5005</span>;</span><br><span class="line"><span class="keyword">int</span> n,v;</span><br><span class="line"><span class="keyword">int</span> f[<span class="number">5005</span>];</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="built_in">cin</span>>>n>>v;</span><br><span class="line"> <span class="keyword">int</span> c,w,m;</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="built_in">cin</span>>>c>>w>>m;</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> j=v;j>=c;j--){</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> k=<span class="number">1</span>;k<=m &&k*c<=j;k++){</span><br><span class="line"> f[j]=<span class="built_in">max</span>(f[j],f[j-k*c]+k*w);</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">cout</span><<f[v];</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/02/%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85/" data-id="ck7qewnvy00080oh41w8o29pt" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" rel="tag">动态规划</a></li></ul>
</footer>
</div>
</article>
<article id="post-任意进制转换" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/01/%E4%BB%BB%E6%84%8F%E8%BF%9B%E5%88%B6%E8%BD%AC%E6%8D%A2/" class="article-date">
<time datetime="2020-03-01T15:15:46.000Z" itemprop="datePublished">2020-03-01</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/01/%E4%BB%BB%E6%84%8F%E8%BF%9B%E5%88%B6%E8%BD%AC%E6%8D%A2/">任意进制转换</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="任意进制转换"><a href="#任意进制转换" class="headerlink" title="任意进制转换"></a>任意进制转换</h1><p>给出一个A<em>A</em>进制数N<em>N</em>，你要把它转成B<em>B</em>进制。</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行是两个整数A,B(2<=A,B<=16)<em>A</em>,<em>B</em>(2<=<em>A</em>,<em>B</em><=16)。</p>
<p>第二行是一个A<em>A</em>进制的字符串N<em>N</em>。题目保证A<em>A</em>进制数N<em>N</em>转成1010进制后的范围在int<em>i*</em>n*<em>t</em>型范围内。</p>
<p>如果A>=10<em>A</em>>=10,且某些位的权值大于等于1010，那么权值就用小写字母表示，比如，a<em>a</em>代表1010，b<em>b</em>代表1111，c<em>c</em>代表1212，d<em>d</em>代表1313，e<em>e</em>代表1414，f<em>f</em>代表1515。</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>输出N<em>N</em>转成B<em>B</em>进制的结果。</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入-1"><a href="#输入-1" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">10 2</span><br><span class="line">100</span><br></pre></td></tr></table></figure>
<h4 id="输出-1"><a href="#输出-1" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">1100100</span><br></pre></td></tr></table></figure>
<h4 id="输入-2"><a href="#输入-2" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">2 16</span><br><span class="line">10001111</span><br></pre></td></tr></table></figure>
<h4 id="输出-2"><a href="#输出-2" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">8f</span><br></pre></td></tr></table></figure>
<p>题解</p>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/*************************************************************************</span></span><br><span class="line"><span class="comment"> > File Name: 6.cpp</span></span><br><span class="line"><span class="comment"> > Author: qywk99</span></span><br><span class="line"><span class="comment"> > Mail: 2529107424@qq.com </span></span><br><span class="line"><span class="comment"> > Created Time: Tue Feb 25 13:38:04 2020</span></span><br><span class="line"><span class="comment"> ************************************************************************/</span></span><br><span class="line"></span><br><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">Atoten</span><span class="params">(<span class="keyword">int</span> A,<span class="built_in">string</span> str)</span></span>{</span><br><span class="line"> <span class="keyword">int</span> len=str.<span class="built_in">size</span>();</span><br><span class="line"> <span class="keyword">int</span> res=<span class="number">0</span>;</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">0</span>;i<len;i++){</span><br><span class="line"> <span class="keyword">if</span>(<span class="built_in">isalpha</span>(str[i])){</span><br><span class="line"> res=res*A+str[i]-<span class="string">'a'</span>+<span class="number">10</span>;</span><br><span class="line"> }<span class="keyword">else</span></span><br><span class="line"> res=res*A+str[i]-<span class="string">'0'</span>;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">return</span> res;</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="built_in">string</span> <span class="title">TentoB</span><span class="params">(<span class="keyword">int</span> B,<span class="keyword">int</span> num)</span></span>{</span><br><span class="line"> <span class="keyword">if</span>(num==<span class="number">0</span>)</span><br><span class="line"> <span class="keyword">return</span> <span class="string">"0"</span>;</span><br><span class="line"> <span class="built_in">string</span> str=<span class="string">""</span>;</span><br><span class="line"> <span class="keyword">while</span>(num){</span><br><span class="line"> <span class="keyword">char</span> ch=num%B;</span><br><span class="line"> num/=B;</span><br><span class="line"> <span class="keyword">if</span>(ch<=<span class="number">9</span>){</span><br><span class="line"> str=<span class="keyword">char</span>(ch+<span class="string">'0'</span>)+str;</span><br><span class="line"> }<span class="keyword">else</span></span><br><span class="line"> str=<span class="keyword">char</span>(ch+<span class="string">'a'</span><span class="number">-10</span>)+str;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">return</span> str;</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="keyword">int</span> A,B;</span><br><span class="line"> <span class="built_in">string</span> N;</span><br><span class="line"> <span class="built_in">cin</span>>>A>>B>>N;</span><br><span class="line"> <span class="keyword">int</span> num=Atoten(A,N);</span><br><span class="line"> <span class="built_in">cout</span><<TentoB(B,num);</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/01/%E4%BB%BB%E6%84%8F%E8%BF%9B%E5%88%B6%E8%BD%AC%E6%8D%A2/" data-id="ck7qewnvu00040oh4az9xcwsd" class="article-share-link">Share</a>
<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>
</footer>
</div>
</article>
<article id="post-数值与字符的相互转换" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/03/01/%E6%95%B0%E5%80%BC%E4%B8%8E%E5%AD%97%E7%AC%A6%E7%9A%84%E7%9B%B8%E4%BA%92%E8%BD%AC%E6%8D%A2/" class="article-date">
<time datetime="2020-03-01T14:35:05.000Z" itemprop="datePublished">2020-03-01</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/03/01/%E6%95%B0%E5%80%BC%E4%B8%8E%E5%AD%97%E7%AC%A6%E7%9A%84%E7%9B%B8%E4%BA%92%E8%BD%AC%E6%8D%A2/">数值与字符的相互转换</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<p>对于刚做刷算法题的同学来说，数值与字符的相互转换十分麻烦，我就介绍比较常用的转换方式。</p>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="function"><span class="built_in">string</span> <span class="title">To_string</span><span class="params">(<span class="keyword">int</span> num)</span></span>{</span><br><span class="line"> <span class="keyword">if</span>(num==<span class="number">0</span>)</span><br><span class="line"> <span class="keyword">return</span> <span class="string">"0"</span>;</span><br><span class="line"> <span class="keyword">bool</span> flag=<span class="literal">false</span>;<span class="comment">//标记是否为负数；</span></span><br><span class="line"> <span class="built_in">string</span> res=<span class="string">""</span>;</span><br><span class="line"> <span class="keyword">if</span>(num<<span class="number">0</span>){</span><br><span class="line"> flag=<span class="literal">true</span>;</span><br><span class="line"> num=-num;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">while</span>(num){</span><br><span class="line"> res=<span class="keyword">char</span>(num%<span class="number">10</span>+<span class="string">'0'</span>)+res;</span><br><span class="line"> num/=<span class="number">10</span>;</span><br><span class="line"> }</span><br><span class="line"> <span class="keyword">if</span>(flag)</span><br><span class="line"> <span class="keyword">return</span> <span class="string">"-"</span>+res;</span><br><span class="line"> <span class="keyword">else</span></span><br><span class="line"> <span class="keyword">return</span> res;</span><br><span class="line">}</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="keyword">char</span> str1[]=<span class="string">"123456"</span>;</span><br><span class="line"> <span class="keyword">char</span> str2[]=<span class="string">"123.456"</span>;</span><br><span class="line"> <span class="keyword">int</span> d=atoi(str1);<span class="comment">//转为整形</span></span><br><span class="line"> <span class="keyword">int</span> ll=atol(str1);<span class="comment">//转为长整形</span></span><br><span class="line"> <span class="keyword">double</span> lf=atof(str2);<span class="comment">//转为浮点型</span></span><br><span class="line"> <span class="built_in">cout</span><<d<<<span class="built_in">endl</span>;</span><br><span class="line"> <span class="built_in">cout</span><<ll<<<span class="built_in">endl</span>;</span><br><span class="line"> <span class="built_in">cout</span><<lf<<<span class="built_in">endl</span>;</span><br><span class="line"></span><br><span class="line"> <span class="comment">//因为蓝桥杯使用的是C98的标准，所以to_string无法使用，我们可以自己封装</span></span><br><span class="line"> <span class="built_in">cout</span><<To_string(<span class="number">10</span>)<<<span class="built_in">endl</span>;</span><br><span class="line"> <span class="comment">//也可利用sprintf函数，输出到字符数组里。</span></span><br><span class="line"> <span class="keyword">char</span> ch[<span class="number">10</span>];</span><br><span class="line"> <span class="built_in">sprintf</span>(ch,<span class="string">"%d"</span>,<span class="number">1234</span>);</span><br><span class="line"> <span class="built_in">strlen</span>(ch);<span class="comment">//也可以获取数值是几位数的，要小心是负数的情况哦。</span></span><br><span class="line"> <span class="built_in">cout</span><<ch<<<span class="built_in">endl</span>;</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/03/01/%E6%95%B0%E5%80%BC%E4%B8%8E%E5%AD%97%E7%AC%A6%E7%9A%84%E7%9B%B8%E4%BA%92%E8%BD%AC%E6%8D%A2/" data-id="ck7qewnwd000g0oh494300v6y" class="article-share-link">Share</a>
</footer>
</div>
</article>
<article id="post-01背包" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/25/01%E8%83%8C%E5%8C%85/" class="article-date">
<time datetime="2020-02-25T14:54:16.000Z" itemprop="datePublished">2020-02-25</time>
</a>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/25/01%E8%83%8C%E5%8C%85/">01背包</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="01背包"><a href="#01背包" class="headerlink" title="01背包"></a>01背包</h1><p>有 N<em>N</em> 件物品和一个容量为 V<em>V</em> 的背包。第i<em>i</em>件物品的体积是 C_i<em>C**i</em> ，得到的价值是 W_i<em>W*</em>i*。求解将哪些物品装入背包可使价值总和最大。</p>
<h3 id="输入"><a href="#输入" class="headerlink" title="输入"></a>输入</h3><p>第一行是两个整数N<em>N</em>和V(1<=N,V<=1000)<em>V</em>(1<=<em>N</em>,<em>V</em><=1000)。 </p>
<p>接下来N<em>N</em>行，每行有两个数C_i<em>C<strong>i<em>和W_i(1<=C_i,W_i<=1000)</em>W</strong>i</em>(1<=<em>C**i</em>,<em>W**i</em><=1000)，分别代表体积和价值。</p>
<h3 id="输出"><a href="#输出" class="headerlink" title="输出"></a>输出</h3><p>输出能得到的最大价值。</p>
<h3 id="样例"><a href="#样例" class="headerlink" title="样例"></a>样例</h3><h4 id="输入-1"><a href="#输入-1" class="headerlink" title="输入"></a>输入</h4><figure class="highlight plain"><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></pre></td><td class="code"><pre><span class="line">5 10</span><br><span class="line">1 5</span><br><span class="line">2 4</span><br><span class="line">3 3</span><br><span class="line">4 2</span><br><span class="line">5 1</span><br></pre></td></tr></table></figure>
<h4 id="输出-1"><a href="#输出-1" class="headerlink" title="输出"></a>输出</h4><figure class="highlight plain"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">14</span><br></pre></td></tr></table></figure>
<figure class="highlight c++"><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><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string"><bits/stdc++.h></span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">int</span> c[<span class="number">1005</span>],w[<span class="number">1005</span>];</span><br><span class="line"><span class="keyword">int</span> f[<span class="number">1005</span>];</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"> <span class="keyword">int</span> n, m;</span><br><span class="line"> <span class="built_in">cin</span>>>n>>m;</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="built_in">cin</span>>>c[i]>>w[i];</span><br><span class="line"></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=m;j >= c[i];j--){</span><br><span class="line"> f[j]=<span class="built_in">max</span>(f[j],f[j-c[i]]+w[i]);</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">cout</span><<f[m];</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/25/01%E8%83%8C%E5%8C%85/" data-id="ck7qewnvd00000oh4e2dtcgen" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" rel="tag">动态规划</a></li></ul>
</footer>
</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/">Next &raquo;</a>
</nav>
</section>
<aside id="sidebar">
<div class="widget-wrap">
<h3 class="widget-title">Tags</h3>
<div class="widget">
<ul class="tag-list" itemprop="keywords"><li class="tag-list-item"><a class="tag-list-link" href="/tags/dfs/" rel="tag">dfs</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/vimrc/" rel="tag">vimrc</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/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" 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%E6%8D%AE%E7%BB%93%E6%9E%84/" 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/%E7%AE%97%E6%B3%95/" rel="tag">算法</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/%E7%BB%93%E6%9E%84%E4%BD%93/" rel="tag">结构体</a></li></ul>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Tag Cloud</h3>
<div class="widget tagcloud">
<a href="/tags/dfs/" style="font-size: 15px;">dfs</a> <a href="/tags/vimrc/" style="font-size: 10px;">vimrc</a> <a href="/tags/%E4%BA%8C%E5%88%86/" style="font-size: 10px;">二分</a> <a href="/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" style="font-size: 20px;">动态规划</a> <a href="/tags/%E6%8E%92%E5%BA%8F/" style="font-size: 10px;">排序</a> <a href="/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/" style="font-size: 10px;">数据结构</a> <a href="/tags/%E6%95%B0%E8%AE%BA/" style="font-size: 10px;">数论</a> <a href="/tags/%E7%AE%97%E6%B3%95/" style="font-size: 10px;">算法</a> <a href="/tags/%E7%BB%93%E6%9E%84%E4%BD%93/" style="font-size: 10px;">结构体</a>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Archives</h3>
<div class="widget">
<ul class="archive-list"><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/03/">March 2020</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/02/">February 2020</a></li></ul>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Recent Posts</h3>
<div class="widget">
<ul>
<li>
<a href="/2020/03/10/%E7%AB%99%E9%98%9F/">站队</a>
</li>
<li>
<a href="/2020/03/10/%E5%88%87%E9%A6%99%E8%82%A0/">切香肠</a>
</li>
<li>
<a href="/2020/03/06/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85/">完全背包</a>
</li>
<li>
<a href="/2020/03/04/%E7%BA%BF%E6%AE%B5%E6%A0%91/">线段树</a>
</li>
<li>
<a href="/2020/03/04/%E4%BA%8C%E7%BB%B4%E8%BF%B7%E5%AE%AB/">二维迷宫</a>
</li>
</ul>
</div>
</div>
</aside>
</div>
<footer id="footer">
<div class="outer">
<div id="footer-info" class="inner">
© 2020 John Doe<br>
Powered by <a href="http://hexo.io/" target="_blank">Hexo</a>
</div>
</div>
</footer>
</div>
<nav id="mobile-nav">
<a href="/" class="mobile-nav-link">Home</a>
<a href="/archives" class="mobile-nav-link">Archives</a>
</nav>
<script src="//ajax.googleapis.com/ajax/libs/jquery/2.0.3/jquery.min.js"></script>
<link rel="stylesheet" href="/fancybox/jquery.fancybox.css">
<script src="/fancybox/jquery.fancybox.pack.js"></script>
<script src="/js/script.js"></script>
</div>
</body>
</html>