-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
460 lines (429 loc) · 53.3 KB
/
index.html
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
<!DOCTYPE html><html lang="zh-CN" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no"><title>白生也的成长小站</title><meta name="author" content="白生也"><meta name="copyright" content="白生也"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta property="og:type" content="website">
<meta property="og:title" content="白生也的成长小站">
<meta property="og:url" content="http://example.com/index.html">
<meta property="og:site_name" content="白生也的成长小站">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="https://s1.ax1x.com/2022/07/13/jWtFv4.png">
<meta property="article:author" content="白生也">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="https://s1.ax1x.com/2022/07/13/jWtFv4.png"><link rel="shortcut icon" href="https://s1.ax1x.com/2022/07/13/jWtFv4.png"><link rel="canonical" href="http://example.com/"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css" media="print" onload="this.media='all'"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fancyapps/ui/dist/fancybox.min.css" media="print" onload="this.media='all'"><script>const GLOBAL_CONFIG = {
root: '/',
algolia: undefined,
localSearch: {"path":"/search.xml","preload":true,"languages":{"hits_empty":"找不到您查询的内容：${query}"}},
translate: undefined,
noticeOutdate: undefined,
highlight: {"plugin":"highlighjs","highlightCopy":true,"highlightLang":true,"highlightHeightLimit":false},
copy: {
success: '复制成功',
error: '复制错误',
noSupport: '浏览器不支持'
},
relativeDate: {
homepage: false,
post: false
},
runtime: '天',
date_suffix: {
just: '刚刚',
min: '分钟前',
hour: '小时前',
day: '天前',
month: '个月前'
},
copyright: {"limitCount":50,"languages":{"author":"作者: 白生也","link":"链接: ","source":"来源: 白生也的成长小站","info":"著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。"}},
lightbox: 'fancybox',
Snackbar: undefined,
source: {
justifiedGallery: {
js: 'https://cdn.jsdelivr.net/npm/flickr-justified-gallery/dist/fjGallery.min.js',
css: 'https://cdn.jsdelivr.net/npm/flickr-justified-gallery/dist/fjGallery.min.css'
}
},
isPhotoFigcaption: false,
islazyload: true,
isAnchor: false
}</script><script id="config-diff">var GLOBAL_CONFIG_SITE = {
title: '白生也的成长小站',
isPost: false,
isHome: true,
isHighlightShrink: false,
isToc: false,
postUpdate: '2022-09-25 16:33:19'
}</script><noscript><style type="text/css">
#nav {
opacity: 1
}
.justified-gallery img {
opacity: 1
}
#recent-posts time,
#post-meta time {
display: inline !important
}
</style></noscript><script>(win=>{
win.saveToLocal = {
set: function setWithExpiry(key, value, ttl) {
if (ttl === 0) return
const now = new Date()
const expiryDay = ttl * 86400000
const item = {
value: value,
expiry: now.getTime() + expiryDay,
}
localStorage.setItem(key, JSON.stringify(item))
},
get: function getWithExpiry(key) {
const itemStr = localStorage.getItem(key)
if (!itemStr) {
return undefined
}
const item = JSON.parse(itemStr)
const now = new Date()
if (now.getTime() > item.expiry) {
localStorage.removeItem(key)
return undefined
}
return item.value
}
}
win.getScript = url => new Promise((resolve, reject) => {
const script = document.createElement('script')
script.src = url
script.async = true
script.onerror = reject
script.onload = script.onreadystatechange = function() {
const loadState = this.readyState
if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
script.onload = script.onreadystatechange = null
resolve()
}
document.head.appendChild(script)
})
win.activateDarkMode = function () {
document.documentElement.setAttribute('data-theme', 'dark')
if (document.querySelector('meta[name="theme-color"]') !== null) {
document.querySelector('meta[name="theme-color"]').setAttribute('content', '#0d0d0d')
}
}
win.activateLightMode = function () {
document.documentElement.setAttribute('data-theme', 'light')
if (document.querySelector('meta[name="theme-color"]') !== null) {
document.querySelector('meta[name="theme-color"]').setAttribute('content', '#ffffff')
}
}
const t = saveToLocal.get('theme')
if (t === 'dark') activateDarkMode()
else if (t === 'light') activateLightMode()
const asideStatus = saveToLocal.get('aside-status')
if (asideStatus !== undefined) {
if (asideStatus === 'hide') {
document.documentElement.classList.add('hide-aside')
} else {
document.documentElement.classList.remove('hide-aside')
}
}
const detectApple = () => {
if(/iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)){
document.documentElement.classList.add('apple')
}
}
detectApple()
})(window)</script><link rel="stylesheet" href="/css/background.css"><meta name="generator" content="Hexo 6.2.0"><link rel="alternate" href="/atom.xml" title="白生也的成长小站" type="application/atom+xml">
</head><body><div id="loading-box"><div class="loading-left-bg"></div><div class="loading-right-bg"></div><div class="spinner-box"><div class="configure-border-1"><div class="configure-core"></div></div><div class="configure-border-2"><div class="configure-core"></div></div><div class="loading-word">加载中...</div></div></div><div id="web_bg"></div><div id="sidebar"><div id="menu-mask"></div><div id="sidebar-menus"><div class="avatar-img is-center"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://s1.ax1x.com/2022/07/13/jWtFv4.png" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"/></div><div class="sidebar-site-data site-data is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">218</div></a><a href="/tags/"><div class="headline">标签</div><div class="length-num">85</div></a><a href="/categories/"><div class="headline">分类</div><div class="length-num">23</div></a></div><hr/><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fas fa-heartbeat"></i><span> 娱乐</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/music/"><i class="fa-fw fas fa-music"></i><span> 音乐</span></a></li><li><a class="site-page child" href="/gallery/"><i class="fa-fw fas fa-images"></i><span> 照片</span></a></li><li><a class="site-page child" href="/movies/"><i class="fa-fw fas fa-video"></i><span> 电影</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 友链</span></a></div><div class="menus_item"><a class="site-page" href="/about/"><i class="fa-fw fas fa-heart"></i><span> 关于我</span></a></div></div></div></div><div class="page" id="body-wrap"><header class="full_page" id="page-header" style="background-image: url('https://img.xjh.me/random_img.php?type=bg&return=302')"><nav id="nav"><span id="blog_name"><a id="site-name" href="/">白生也的成长小站</a></span><div id="menus"><div id="search-button"><a class="site-page social-icon search"><i class="fas fa-search fa-fw"></i><span> 搜索</span></a></div><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fas fa-heartbeat"></i><span> 娱乐</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/music/"><i class="fa-fw fas fa-music"></i><span> 音乐</span></a></li><li><a class="site-page child" href="/gallery/"><i class="fa-fw fas fa-images"></i><span> 照片</span></a></li><li><a class="site-page child" href="/movies/"><i class="fa-fw fas fa-video"></i><span> 电影</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 友链</span></a></div><div class="menus_item"><a class="site-page" href="/about/"><i class="fa-fw fas fa-heart"></i><span> 关于我</span></a></div></div><div id="toggle-menu"><a class="site-page"><i class="fas fa-bars fa-fw"></i></a></div></div></nav><div id="site-info"><h1 id="site-title">白生也的成长小站</h1><div id="site_social_icons"><a class="social-icon" href="/[email protected]" target="_blank" title="Email"><i class="fas fa-envelope"></i></a></div></div><div id="scroll-down"><i class="fas fa-angle-down scroll-down-effects"></i></div></header><main class="layout" id="content-inner"><div class="recent-posts" id="recent-posts"><div class="recent-post-item"><div class="post_cover left"><a href="/2022/09/25/hexo/hello-world/" title="Hello World"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://www.dmoe.cc/random.php?return=302" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="Hello World"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/09/25/hexo/hello-world/" title="Hello World">Hello World</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-09-25T03:26:10.912Z" title="发表于 2022-09-25 11:26:10">2022-09-25</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/Hexo/">Hexo</a></span></div><div class="content">Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
Quick Start
Create a new post
1$ hexo new "My New Post"
More info: Writing
Run server
1$ hexo server
More info: Server
Generate static files
1$ hexo generate
More info: Generating
Deploy to remote sites
1$ hexo deploy
More info: Deployment
</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4312-%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0/" title="4312-出现次数"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.btstu.cn/sjbz/api.php?lx=dongman&format=images&return=302" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4312-出现次数"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4312-%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0/" title="4312-出现次数">4312-出现次数</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.946Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
给定一个长度为 n 的字符串 S=s1s2…sn 以及一个长度为 m 的字符串 T=t1t2…tm。
两个字符串都由小写字母构成。
用 s[l,r] 来表示字符串 S 的子串 slsl+1…sr。
有 q 个询问，每个询问给出两个整数 li,ri``（1≤li≤ri≤n），请你计算字符串 T 在 s[li,ri] 中作为子串出现了多少次。
例如，字符串 abacabadabacaba 中共包含 4 个子串 ba，所以 ba 在 abacabadabacaba 中作为子串出现了 4 次。
输入格式
第一行包含三个整数 n,m,q。
第二行包含一个长度为 n 的由小写字母构成的字符串 S。
第三行包含一个长度为 m 的由小写字母构成的字符串 T。
接下来 q 行，每行包含两个整数 li,ri。
输出格式
每个询问输出一行答案，一个整数，表示出现次数。
数据范围
前三个测试点满足 1≤n,m,q≤20。
所有测试点满足 1≤n,m≤1000，1≤q≤105，1≤li≤ri≤n。
样例
1234567891011121314151617181920输入样例1：15 2 3abacabad ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4311-%E6%9C%80%E5%B0%8F%E5%80%BC/" title="4311-最小值"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.cyfan.top/acg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4311-最小值"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4311-%E6%9C%80%E5%B0%8F%E5%80%BC/" title="4311-最小值">4311-最小值</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.944Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
给定一个正整数 m 和 n 个分数 a1b1,a2b2,…,anbna_1b_1,a_2b_2,…,a_nb_na1b1,a2b2,…,anbn。
请你计算 m×min(a1b1,a2b2,…,anbn)m×min(\frac{a_1}{b_1} ,\frac{a_2}{b_2},…,\frac{a_n}{b_n})m×min(b1a1,b2a2,…,bnan) 的值。
输入格式
第一行包含两个整数 n,m。
接下来 n 行，每行包含两个整数 ai,bia_i,b_iai,bi。
输出格式
输出一个实数表示结果，结果保留 6 位小数。
数据范围
前三个测试点满足 1≤n≤50。
所有测试点满足 1≤n≤5000，1≤m≤100，1≤ai,bi≤1001≤n≤5000，1≤m≤100，1≤a_i,b_i≤1001≤n≤5000，1≤m≤100，1≤ai,bi≤100。
样例
12345678910111213输入样例1：3 51 23 41 3输出样例1：1.666667输入样例2：2 199 10098 99输出样例2：0.989899
分析 ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4307-%E6%95%B0%E5%AD%97%E9%87%8D%E6%8E%92/" title="4307-数字重排"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/mc" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4307-数字重排"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4307-%E6%95%B0%E5%AD%97%E9%87%8D%E6%8E%92/" title="4307-数字重排">4307-数字重排</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.939Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
给定两个正整数 a 和 b，均不含前导 0。
现在，请你对 a 进行重构，重新排列其各位数字顺序，得到一个不含前导 0 的新正整数。
要求新正整数在不超过 b 的前提下，尽可能大。
输出新正整数。
注意，我们允许新正整数等于 a，即保持原样不变。
输入格式
第一行包含一个正整数 a。
第二行包含一个正整数 b。
两个输入数字均不含前导 0。
输出格式
一个不含前导 0 的正整数，表示答案。
数据保证一定有解。
数据范围
前 6 个测试点满足 1≤a,b≤1091≤a,b≤10^91≤a,b≤109。
所有测试点满足 1≤a,b≤10181≤a,b≤10^{18}1≤a,b≤1018。
样例
123456789101112131415输入样例1：123222输出样例1：213输入样例2：392110000输出样例2：9321输入样例3：49405000输出样例3：4940
分析
1234贪心: sort(a,a+n); 优先选取最大的数字MAX来填充，该空位用MAX所组成的最小的数小于等于target的话那么就可以找到 MAX不行就用第二、第三...依次尝试
解答 ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4306-%E5%BA%8F%E5%88%97%E5%A4%84%E7%90%86/" title="4306-序列处理"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/pixiv" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4306-序列处理"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4306-%E5%BA%8F%E5%88%97%E5%A4%84%E7%90%86/" title="4306-序列处理">4306-序列处理</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.937Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
给定一个长度为 n 的整数序列 a1,a2,…,ana_1,a_2,…,a_na1,a2,…,an。
我们可以对该序列进行修改操作，每次操作选中其中一个元素，并使其增加 1。
现在，请你计算要使得序列中的元素各不相同，至少需要进行多少次操作。
输入格式
第一行包含整数 n。
第二行包含 n 个整数 a1,a2,…,ana_1,a_2,…,a_na1,a2,…,an。
输出格式
一个整数，表示所需的最少操作次数。
数据范围
前 6 个测试点满足 1≤n≤101≤n≤101≤n≤10。
所有测试点满足 1≤n≤3000，1≤ai≤n1≤n≤3000，1≤a_i≤n1≤n≤3000，1≤ai≤n。
样例
12345678910输入样例1：41 3 1 4输出样例1：1输入样例2：51 2 3 2 5输出样例2：2
分析
123贪心: sort(a,a+n); 排序之后后一个数大于等于前一个数的，而只有在大于的时候才能实现互不相同
解答
123456789101112131415161718192021222324252627282930#include < ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4305-%E6%96%90%E6%B3%A2%E6%8B%89%E5%A5%91%E6%95%B0%E5%88%97/" title="4305-斐波拉契数列"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/mc" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4305-斐波拉契数列"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4305-%E6%96%90%E6%B3%A2%E6%8B%89%E5%A5%91%E6%95%B0%E5%88%97/" title="4305-斐波拉契数列">4305-斐波拉契数列</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.934Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
斐波那契数列指的是这样一个数列：1、1、2、3、5、8、13、21、34、……
在数学上，斐波那契数列以如下递推的形式定义：F(0)=1，F(1)=1,F(n)=F(n−1)+F(n−2)（n≥2，n∈N∗）。
如果一个数出现在斐波那契数列之中，那么我们就称这个数为斐波那契数。
现在，给定一个整数 n，请你构造一个长度为 n 的字符串 s1s2…sns_1s_2…s_ns1s2…sn。
对于字符串中的第 i 个字符 sis_isi：
如果 i 是斐波那契数，则 sis_isi 为大写字母 O。
如果 i 不是斐波那契数，则 sis_isi 为小写字母 o。
输出构造好的字符串。
注意，字符下标从 1 到 n。
输入格式
一个整数 n。
输出格式
一个字符串，表示答案。
数据范围
前三个测试点满足 1≤n≤1001≤n≤1001≤n≤100。
所有测试点满足 1≤n≤10001≤n≤10001≤n≤1000。
样例
12345678输入样例1：8输出样例1：OOOoOooO输入样例2：15输出样例2：OOOoOooOooooOoo
分析
1预先把1~n之间的斐波拉契数算 ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches38/4301-%E6%88%AA%E6%96%AD%E5%BA%8F%E5%88%97/" title="4301-截断序列"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/pixiv" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4301-截断序列"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches38/4301-%E6%88%AA%E6%96%AD%E5%BA%8F%E5%88%97/" title="4301-截断序列">4301-截断序列</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.929Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
给定一个由 n 位数字组成的序列 a1a2…ana_1a_2…a_na1a2…an。
其中，每个数字都是 0∼9 之一。
请你判断，能否将数列从中间截断为两个或更多个非空部分，要求每一部分的各位数字之和都相等。
例如，350178 可以截断为 3 个部分 350、17、8，并且满足 3+5+0=1+7=8。
输入格式
第一行包含一个整数 n。
第二行包含 n 个数字 a1,a2,…,ana_1,a_2,…,a_na1,a2,…,an，数字之间不含空格。
输出格式
如果可以按要求截断数列，则输出 YES，否则输出 NO。
数据范围
前 6 个测试点满足 2≤n≤102≤n≤102≤n≤10。
所有测试点满足 2≤n≤100，0≤ai≤92≤n≤100，0≤a_i≤92≤n≤100，0≤ai≤9。
样例
1234567891011输入样例1：573452输出样例1：YES输入样例2：41248输出样例2：NO
分析
思路
假设序列所有位上的数之和是sum，并且可以被分成i段,那么每一段之和就是s=sum/i;
然后我们就遍历序列，测试是不是能找到一段之和位s的每一段, ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches38/4300-%E4%B8%A4%E7%A7%8D%E6%93%8D%E4%BD%9C/" title="4300-两种操作"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/pixiv" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4300-两种操作"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches38/4300-%E4%B8%A4%E7%A7%8D%E6%93%8D%E4%BD%9C/" title="4300-两种操作">4300-两种操作</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.927Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
给定一个正整数 n，我们希望你可以通过一系列的操作，将其变为另一个正整数 m。
操作共分两种：
将当前的数乘以 2。
将当前的数减去 1。
要求，在变换过程中，数字始终为正。
请你计算，所需要的最少操作次数。
输入格式
一行，两个不同的正整数 n 和 m。
输出格式
一个整数，表示所需的最少操作次数。
数据范围
前 6 个测试点满足 1≤n,m≤101≤n,m≤101≤n,m≤10。
所有测试点满足 1≤n,m≤100001≤n,m≤100001≤n,m≤10000。
样例
123456789输入样例1：4 6输出样例1：2输入样例2：10 1输出样例2：9
分析
贪心思路
1234567if end比start要小: 那就只能减一达到目的如果不是: 就一直让end减小直到小于start (对应到题目的操作就end有两种变换方式:/2、+1) if end是奇数就+1 一直减小然后就只能减一达到目的
解答
1234567891011121314151617181920212223242526272829303132#include <iostre ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches38/4299-%E5%88%A0%E7%82%B9/" title="4299-删点"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/pc" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4299-删点"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches38/4299-%E5%88%A0%E7%82%B9/" title="4299-删点">4299-删点</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.925Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
在一个二维平面上有 n 个点，其中没有任何一个点位于 y 轴上。
请你判断这些点中是否存在一点满足，删除该点后，剩余的所有点都在 y 轴的同一侧。
输入格式
第一行包含整数 n。
接下来 n 行，每行包含两个整数 x,y，表示其中一个点的横纵坐标。
点的位置两两不重合。
输出格式
如果存在满足要求的点，则输出 Yes，否则输出 No。
数据范围
前三个测试点满足 2≤n≤102≤n≤102≤n≤10。
所有测试点满足 2≤n≤100，∣x∣,∣y∣≤100，∣x∣≠02≤n≤100，|x|,|y|≤100，|x|≠02≤n≤100，∣x∣,∣y∣≤100，∣x∣=0。
样例
123456789101112131415161718192021222324输入样例1：31 1-1 -12 -1输出样例1：Yes输入样例2：41 12 2-1 1-2 2输出样例2：No输入样例3：31 22 14 60输出样例3：Yes
分析
暴力判断O(n)O(n)O(n)
解答
1234567891011121314151617181920212223242526#include <ios ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches37/4298-%E6%90%AD%E6%A1%A3/" title="4298-搭档"><img class="post_bg" src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.dujin.org/pic/ghibli" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4298-搭档"></a></div><div class="recent-post-info"><a class="article-title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches37/4298-%E6%90%AD%E6%A1%A3/" title="4298-搭档">4298-搭档</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-07-16T03:25:18.918Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/">算法</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/">Acwing</a><i class="fas fa-angle-right article-meta-link"></i><a class="article-meta__categories" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/">Acwing周赛</a></span></div><div class="content">题目
有 n 个男孩，每个人的魅力值依次为 a1,a2,…,ana_1,a_2,…,a_na1,a2,…,an.
有 m 个女孩，每个人的魅力值依次为 b1,b2,…,bmb_1,b_2,…,b_mb1,b2,…,bm。
学校举办舞会，希望选出尽可能多的男女搭档参加。
已知，当一对男女的魅力值相差不超过 1 时，他们才会愿意组成搭档。
请问，最多可以同时凑出多少对搭档参加舞会。
注意：
不能男男配对或女女配对。
每个男生最多只能和一个女生配对，反之亦然。
输入格式
第一行包含整数 n。
第二行包含 n 个整数 a1,a2,…,ana_1,a_2,…,a_na1,a2,…,an。
第三行包含整数 m。
第四行包含 m 个整数 b1,b2,…,bmb_1,b_2,…,b_mb1,b2,…,bm。
输出格式
一个整数，表示最大可能对数。
数据范围
前 6 个测试点满足 1≤n,m≤51≤n,m≤51≤n,m≤5,
所有测试点满足 1≤n,m≤100，1≤ai,bi≤1001≤n,m≤100，1≤a_i,b_i≤1001≤n,m≤100，1≤ai,bi≤100。 ...</div></div></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/page/2/#content-inner">2</a><span class="space">…</span><a class="page-number" href="/page/22/#content-inner">22</a><a class="extend next" rel="next" href="/page/2/#content-inner"><i class="fas fa-chevron-right fa-fw"></i></a></div></nav></div><div class="aside-content" id="aside-content"><div class="card-widget card-info"><div class="is-center"><div class="avatar-img"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://s1.ax1x.com/2022/07/13/jWtFv4.png" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"/></div><div class="author-info__name">白生也</div><div class="author-info__description">“你也喜欢跑步吗?”——《强风吹拂》</div></div><div class="card-info-data site-data is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">218</div></a><a href="/tags/"><div class="headline">标签</div><div class="length-num">85</div></a><a href="/categories/"><div class="headline">分类</div><div class="length-num">23</div></a></div><a id="card-info-btn" target="_blank" rel="noopener" href="https://github.com/baishengye"><i class="fab fa-github"></i><span>看看我的github?</span></a><div class="card-info-social-icons is-center"><a class="social-icon" href="/[email protected]" target="_blank" title="Email"><i class="fas fa-envelope"></i></a></div></div><div class="card-widget card-announcement"><div class="item-headline"><i class="fas fa-bullhorn fa-shake"></i><span>公告</span></div><div class="announcement_content">人生的道路漫长无比,与我一起debug?</div></div><div class="sticky_layout"><div class="card-widget card-recent-post"><div class="item-headline"><i class="fas fa-history"></i><span>最新文章</span></div><div class="aside-list"><div class="aside-list-item"><a class="thumbnail" href="/2022/09/25/hexo/hello-world/" title="Hello World"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://www.dmoe.cc/random.php?return=302" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="Hello World"/></a><div class="content"><a class="title" href="/2022/09/25/hexo/hello-world/" title="Hello World">Hello World</a><time datetime="2022-09-25T03:26:10.912Z" title="发表于 2022-09-25 11:26:10">2022-09-25</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4312-%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0/" title="4312-出现次数"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.btstu.cn/sjbz/api.php?lx=dongman&format=images&return=302" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4312-出现次数"/></a><div class="content"><a class="title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4312-%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0/" title="4312-出现次数">4312-出现次数</a><time datetime="2022-07-16T03:25:18.946Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4311-%E6%9C%80%E5%B0%8F%E5%80%BC/" title="4311-最小值"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.cyfan.top/acg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4311-最小值"/></a><div class="content"><a class="title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches42/4311-%E6%9C%80%E5%B0%8F%E5%80%BC/" title="4311-最小值">4311-最小值</a><time datetime="2022-07-16T03:25:18.944Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4307-%E6%95%B0%E5%AD%97%E9%87%8D%E6%8E%92/" title="4307-数字重排"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/mc" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4307-数字重排"/></a><div class="content"><a class="title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4307-%E6%95%B0%E5%AD%97%E9%87%8D%E6%8E%92/" title="4307-数字重排">4307-数字重排</a><time datetime="2022-07-16T03:25:18.939Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4306-%E5%BA%8F%E5%88%97%E5%A4%84%E7%90%86/" title="4306-序列处理"><img src= "data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" data-lazy-src="https://api.likepoems.com/img/sina/pixiv" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="4306-序列处理"/></a><div class="content"><a class="title" href="/2022/07/16/algorithm/Acwing/WeeklyMatches/WeeklyMatches40/4306-%E5%BA%8F%E5%88%97%E5%A4%84%E7%90%86/" title="4306-序列处理">4306-序列处理</a><time datetime="2022-07-16T03:25:18.937Z" title="发表于 2022-07-16 11:25:18">2022-07-16</time></div></div></div></div><div class="card-widget" id="card-newest-comments"><div class="item-headline"><i class="fas fa-comment-dots"></i><span>最新评论</span></div><div class="aside-list"><span>正在加载中...</span></div></div><div class="card-widget card-categories"><div class="item-headline">
<i class="fas fa-folder-open"></i>
<span>分类</span>
<a class="card-more-btn" href="/categories/" title="查看更多">
<i class="fas fa-angle-right"></i></a>
</div>
<ul class="card-category-list" id="aside-cat-list">
<li class="card-category-list-item "><a class="card-category-list-link" href="/categories/Hexo/"><span class="card-category-list-name">Hexo</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/"><span class="card-category-list-name">算法</span><span class="card-category-list-count">217</span></a><ul class="card-category-list child"><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/Acwing/"><span class="card-category-list-name">Acwing</span><span class="card-category-list-count">217</span></a><ul class="card-category-list child"><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/Acwing/Acwing%E5%91%A8%E8%B5%9B/"><span class="card-category-list-name">Acwing周赛</span><span class="card-category-list-count">21</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/Acwing/%E5%89%91%E6%8C%87offer/"><span class="card-category-list-name">剑指offer</span><span class="card-category-list-count">34</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/Acwing/%E7%AE%97%E6%B3%95%E5%9F%BA%E7%A1%80%E8%AF%BE/"><span class="card-category-list-name">算法基础课</span><span class="card-category-list-count">107</span></a><ul class="card-category-list child"><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/Acwing/%E7%AE%97%E6%B3%95%E5%9F%BA%E7%A1%80%E8%AF%BE/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"><span class="card-category-list-name">动态规划</span><span class="card-category-list-count">9</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/%E7%AE%97%E6%B3%95/Acwing/%E7%AE%97%E6%B3%95%E5%9F%BA%E7%A1%80%E8%AF%BE/%E5%9F%BA%E7%A1%80/"><span class="card-category-list-name">基础</span><span class="card-category-list-count">23</span></a></li></ul></li></ul></li></ul></li>
</ul></div><div class="card-widget card-tags"><div class="item-headline"><i class="fas fa-tags"></i><span>标签</span></div><div class="card-tag-cloud"><a href="/tags/Bellman-Ford%E7%AE%97%E6%B3%95/" style="font-size: 1.1em; color: #999">Bellman-Ford算法</a> <a href="/tags/C/" style="font-size: 1.1em; color: #999">C++</a> <a href="/tags/DP/" style="font-size: 1.2em; color: #999da3">DP</a> <a href="/tags/STL/" style="font-size: 1.1em; color: #999">STL</a> <a href="/tags/bfs/" style="font-size: 1.45em; color: #99a7ba">bfs</a> <a href="/tags/dfs/" style="font-size: 1.3em; color: #99a1ac">dfs</a> <a href="/tags/dfs%E6%B7%B1%E6%90%9C/" style="font-size: 1.15em; color: #999b9e">dfs深搜</a> <a href="/tags/floyd%E7%AE%97%E6%B3%95/" style="font-size: 1.1em; color: #999">floyd算法</a> <a href="/tags/hash/" style="font-size: 1.15em; color: #999b9e">hash</a> <a href="/tags/huffman%E6%A0%91/" style="font-size: 1.1em; color: #999">huffman树</a> <a href="/tags/kmp%E7%AE%97%E6%B3%95/" style="font-size: 1.1em; color: #999">kmp算法</a> <a href="/tags/kruskal%E7%AE%97%E6%B3%95/" style="font-size: 1.1em; color: #999">kruskal算法</a> <a href="/tags/spfa%E7%AE%97%E6%B3%95/" style="font-size: 1.15em; color: #999b9e">spfa算法</a> <a href="/tags/trie/" style="font-size: 1.1em; color: #999">trie</a> <a href="/tags/trie%E6%A0%91/" style="font-size: 1.15em; color: #999b9e">trie树</a> <a href="/tags/%E4%BA%8C%E5%88%86%E5%9B%BE/" style="font-size: 1.15em; color: #999b9e">二分图</a> <a href="/tags/%E4%BA%8C%E5%88%86%E6%B3%95/" style="font-size: 1.5em; color: #99a9bf">二分法</a> <a href="/tags/%E4%BA%8C%E7%BB%B4%E5%B7%AE%E5%88%86/" style="font-size: 1.1em; color: #999">二维差分</a> <a href="/tags/%E4%BD%8D%E8%BF%90%E7%AE%97/" style="font-size: 1.25em; color: #999fa7">位运算</a> <a href="/tags/%E5%85%AC%E5%BC%8F%E6%B3%95%E6%B1%82%E7%BA%A6%E6%95%B0%E4%B9%8B%E5%92%8C/" style="font-size: 1.1em; color: #999">公式法求约数之和</a> <a href="/tags/%E5%85%AC%E5%BC%8F%E6%B3%95%E6%B1%82%E7%BA%A6%E6%95%B0%E7%9A%84%E4%B8%AA%E6%95%B0/" style="font-size: 1.1em; color: #999">公式法求约数的个数</a> <a href="/tags/%E5%89%8D%E7%BC%80%E5%92%8C/" style="font-size: 1.4em; color: #99a5b6">前缀和</a> <a href="/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" style="font-size: 1.1em; color: #999">动态规划</a> <a href="/tags/%E5%8C%88%E7%89%99%E5%88%A9%E7%AE%97%E6%B3%95/" style="font-size: 1.1em; color: #999">匈牙利算法</a> <a href="/tags/%E5%8C%BA%E9%97%B4DP/" style="font-size: 1.1em; color: #999">区间DP</a> <a href="/tags/%E5%8C%BA%E9%97%B4%E5%90%88%E5%B9%B6/" style="font-size: 1.1em; color: #999">区间合并</a> <a href="/tags/%E5%8C%BA%E9%97%B4%E9%97%AE%E9%A2%98/" style="font-size: 1.25em; color: #999fa7">区间问题</a> <a href="/tags/%E5%8D%95%E8%B0%83%E6%A0%88/" style="font-size: 1.1em; color: #999">单调栈</a> <a href="/tags/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/" style="font-size: 1.1em; color: #999">单调队列</a> <a href="/tags/%E5%8D%95%E9%93%BE%E8%A1%A8/" style="font-size: 1.15em; color: #999b9e">单链表</a> <a href="/tags/%E5%8D%A1%E7%89%B9%E5%85%B0%E6%95%B0/" style="font-size: 1.1em; color: #999">卡特兰数</a> <a href="/tags/%E5%8F%8C%E6%8C%87%E9%92%88/" style="font-size: 1.35em; color: #99a3b1">双指针</a> <a href="/tags/%E5%8F%8C%E9%93%BE%E8%A1%A8/" style="font-size: 1.1em; color: #999">双链表</a> <a href="/tags/%E5%93%88%E5%A4%AB%E6%9B%BC%E6%A0%91/" style="font-size: 1.1em; color: #999">哈夫曼树</a> <a href="/tags/%E5%9B%BE%E8%AE%BA/" style="font-size: 1.1em; color: #999">图论</a> <a href="/tags/%E5%A0%86/" style="font-size: 1.15em; color: #999b9e">堆</a> <a href="/tags/%E5%A0%86%E4%BC%98%E5%8C%96dijkstra/" style="font-size: 1.1em; color: #999">堆优化dijkstra</a> <a href="/tags/%E5%A0%86%E4%BC%98%E5%8C%96prim/" style="font-size: 1.1em; color: #999">堆优化prim</a> <a href="/tags/%E5%AE%9A%E4%B9%89%E6%B3%95%E6%B1%82%E6%AC%A7%E6%8B%89%E5%87%BD%E6%95%B0/" style="font-size: 1.1em; color: #999">定义法求欧拉函数</a> <a href="/tags/%E5%B7%AE%E5%88%86/" style="font-size: 1.25em; color: #999fa7">差分</a></div></div><div class="card-widget card-archives"><div class="item-headline"><i class="fas fa-archive"></i><span>归档</span></div><ul class="card-archive-list"><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/09/"><span class="card-archive-list-date">九月 2022</span><span class="card-archive-list-count">1</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/07/"><span class="card-archive-list-date">七月 2022</span><span class="card-archive-list-count">217</span></a></li></ul></div><div class="card-widget card-webinfo"><div class="item-headline"><i class="fas fa-chart-line"></i><span>网站资讯</span></div><div class="webinfo"><div class="webinfo-item"><div class="item-name">文章数目 :</div><div class="item-count">218</div></div><div class="webinfo-item"><div class="item-name">已运行时间 :</div><div class="item-count" id="runtimeshow" data-publishDate="2021-12-25T04:05:09.000Z"><i class="fa-solid fa-spinner fa-spin"></i></div></div><div class="webinfo-item"><div class="item-name">本站总字数 :</div><div class="item-count">119.5k</div></div><div class="webinfo-item"><div class="item-name">本站访客数 :</div><div class="item-count" id="busuanzi_value_site_uv"><i class="fa-solid fa-spinner fa-spin"></i></div></div><div class="webinfo-item"><div class="item-name">本站总访问量 :</div><div class="item-count" id="busuanzi_value_site_pv"><i class="fa-solid fa-spinner fa-spin"></i></div></div><div class="webinfo-item"><div class="item-name">最后更新时间 :</div><div class="item-count" id="last-push-date" data-lastPushDate="2022-09-25T08:33:18.628Z"><i class="fa-solid fa-spinner fa-spin"></i></div></div></div></div></div></div></main><footer id="footer"><div id="footer-wrap"><div class="copyright">©2020 - 2022 By 白生也</div><div class="framework-info"><span>框架 </span><a target="_blank" rel="noopener" href="https://hexo.io">Hexo</a><span class="footer-separator">|</span><span>主题 </span><a target="_blank" rel="noopener" href="https://github.com/jerryc127/hexo-theme-butterfly">Butterfly</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="darkmode" type="button" title="浅色和深色模式转换"><i class="fas fa-adjust"></i></button><button id="hide-aside-btn" type="button" title="单栏和双栏切换"><i class="fas fa-arrows-alt-h"></i></button></div><div id="rightside-config-show"><button id="rightside_config" type="button" title="设置"><i class="fas fa-cog fa-spin"></i></button><button id="go-up" type="button" title="回到顶部"><i class="fas fa-arrow-up"></i></button></div></div><div id="local-search"><div class="search-dialog"><nav class="search-nav"><span class="search-dialog-title">搜索</span><span id="loading-status"></span><button class="search-close-button"><i class="fas fa-times"></i></button></nav><div class="is-center" id="loading-database"><i class="fas fa-spinner fa-pulse"></i><span> 数据库加载中</span></div><div class="search-wrap"><div id="local-search-input"><div class="local-search-box"><input class="local-search-box--input" placeholder="搜索文章" type="text"/></div></div><hr/><div id="local-search-results"></div></div></div><div id="search-mask"></div></div><div><script src="/js/utils.js"></script><script src="/js/main.js"></script><script src="https://cdn.jsdelivr.net/npm/@fancyapps/ui/dist/fancybox.umd.min.js"></script><script src="https://cdn.jsdelivr.net/npm/instant.page/instantpage.min.js" type="module"></script><script src="https://cdn.jsdelivr.net/npm/vanilla-lazyload/dist/lazyload.iife.min.js"></script><script>function panguFn () {
if (typeof pangu === 'object') pangu.autoSpacingPage()
else {
getScript('https://cdn.jsdelivr.net/npm/pangu/dist/browser/pangu.min.js')
.then(() => {
pangu.autoSpacingPage()
})
}
}
function panguInit () {
if (true){
GLOBAL_CONFIG_SITE.isPost && panguFn()
} else {
panguFn()
}
}
document.addEventListener('DOMContentLoaded', panguInit)</script><script src="/js/search/local-search.js"></script><script>var preloader = {
endLoading: () => {
document.body.style.overflow = 'auto';
document.getElementById('loading-box').classList.add("loaded")
},
initLoading: () => {
document.body.style.overflow = '';
document.getElementById('loading-box').classList.remove("loaded")
}
}
window.addEventListener('load',preloader.endLoading())
//原来
//- script.
//- var preloader = {
//- endLoading: () => {
//- document.body.style.overflow = 'auto';
//- document.getElementById('loading-box').classList.add("loaded")
//- },
//- initLoading: () => {
//- document.body.style.overflow = '';
//- document.getElementById('loading-box').classList.remove("loaded")
//- }
//- }
//- window.addEventListener('load',preloader.endLoading())</script><div class="js-pjax"></div><script>window.addEventListener('load', () => {
const changeContent = (content) => {
if (content === '') return content
content = content.replace(/<img.*?src="(.*?)"?[^\>]+>/ig, '[图片]') // replace image link
content = content.replace(/<a[^>]+?href=["']?([^"']+)["']?[^>]*>([^<]+)<\/a>/gi, '[链接]') // replace url
content = content.replace(/<pre><code>.*?<\/pre>/gi, '[代码]') // replace code
content = content.replace(/<[^>]+>/g,"") // remove html tag
if (content.length > 150) {
content = content.substring(0,150) + '...'
}
return content
}
const getComment = () => {
const runTwikoo = () => {
twikoo.getRecentComments({
envId: 'https://twikoo-blog-comments.vercel.app/',
region: '',
pageSize: 6,
includeReply: true
}).then(function (res) {
const twikooArray = res.map(e => {
return {
'content': changeContent(e.comment),
'avatar': e.avatar,
'nick': e.nick,
'url': e.url + '#' + e.id,
'date': new Date(e.created).toISOString()
}
})
saveToLocal.set('twikoo-newest-comments', JSON.stringify(twikooArray), 10/(60*24))
generateHtml(twikooArray)
}).catch(function (err) {
const $dom = document.querySelector('#card-newest-comments .aside-list')
$dom.innerHTML= "无法获取评论，请确认相关配置是否正确"
})
}
if (typeof twikoo === 'object') {
runTwikoo()
} else {
getScript('https://cdn.jsdelivr.net/npm/twikoo/dist/twikoo.all.min.js').then(runTwikoo)
}
}
const generateHtml = array => {
let result = ''
if (array.length) {
for (let i = 0; i < array.length; i++) {
result += '<div class=\'aside-list-item\'>'
if (true) {
const name = 'data-lazy-src'
result += `<a href='${array[i].url}' class='thumbnail'><img ${name}='${array[i].avatar}' alt='${array[i].nick}'></a>`
}
result += `<div class='content'>
<a class='comment' href='${array[i].url}' title='${array[i].content}'>${array[i].content}</a>
<div class='name'><span>${array[i].nick} / </span><time datetime="${array[i].date}">${btf.diffDate(array[i].date, true)}</time></div>
</div></div>`
}
} else {
result += '没有评论'
}
let $dom = document.querySelector('#card-newest-comments .aside-list')
$dom.innerHTML= result
window.lazyLoadInstance && window.lazyLoadInstance.update()
window.pjax && window.pjax.refresh($dom)
}
const newestCommentInit = () => {
if (document.querySelector('#card-newest-comments .aside-list')) {
const data = saveToLocal.get('twikoo-newest-comments')
if (data) {
generateHtml(JSON.parse(data))
} else {
getComment()
}
}
}
newestCommentInit()
document.addEventListener('pjax:complete', newestCommentInit)
})</script><script defer="defer" id="fluttering_ribbon" mobile="false" src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/dist/canvas-fluttering-ribbon.min.js"></script><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script></div></body></html>