https://111qqz.com/en/tags/lazy%E6%A0%87%E8%AE%B0/Recent content in Lazy标记 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzSun, 12 Nov 2017 12:40:24 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-12-poj-3415/Sun, 12 Nov 2017 12:40:24 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-12-poj-3415/<p><a href="http://poj.org/problem?id=3415" target="_blank" rel="noreferrer">http://poj.org/problem?id=3415</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给出两个字符串，问公共长度大于等于k的子串个数（只要两个串的位置不同就认为是不同）</p>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-bzoj-1230/Wed, 01 Nov 2017 02:19:00 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-bzoj-1230/<h2 class="relative group">1230: [Usaco2008 Nov]lites 开关灯 <div id="1230-usaco2008-novlites-开关灯" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#1230-usaco2008-novlites-%e5%bc%80%e5%85%b3%e7%81%af" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 1676  Solved: 874 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1230" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1230" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1230" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-11-28-cf740e/Mon, 28 Nov 2016 07:16:52 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-11-28-cf740e/<p>e:题意：那个数，定义hill为一段连续的区间，满足该区间为严格单峰。现在有若干操作，每个操作是对某段区间的数同时增加一个数，问每次操作后，所有的hill中，宽度最大的（区间长度最大）的是多少。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-11-13-hdu-4747-mex-efbc88e7babfe6aeb5e6a091lazye6a087e8aeb0efbc89/Sun, 13 Nov 2016 10:10:47 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-11-13-hdu-4747-mex-efbc88e7babfe6aeb5e6a091lazye6a087e8aeb0efbc89/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=4747" target="_blank" rel="noreferrer">题目连接</a></p> <p>题意：给出n(n&lt;=200000)个数，问所有区间[l,r]中mex的和。 （一个区间mex的定义为，这个区间中没有出现的最小的非负数）</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-27-cf145e/Tue, 27 Sep 2016 11:15:53 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-27-cf145e/<p><a href="http://codeforces.com/problemset/problem/145/E" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：给出一串只由数字'4&rsquo;和'7&rsquo;组成的串。两种操作，一种是询问整个串中最长非下降子序列的长度，另一种给出区间[l,r]，将区间中的没个数反转，反转的定义为，4变成7,7变成4.</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-25-cf52c/Sun, 25 Sep 2016 22:43:40 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-25-cf52c/<p><a href="http://codeforces.com/problemset/problem/52/C" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：一个循环数列，两种操作，一种是把某段区间中加上v，另一种是询问某区间的最小值。对于每个询问，输出答案。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-13-light-oj-1080-binary-simulation-e7babfe6aeb5e6a091lazye6a087e8aeb0efbc8ce58cbae997b4e69bb4e696b0efbc8ce58d95e782b9e69fa5e8afa2/Tue, 13 Sep 2016 17:41:49 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-13-light-oj-1080-binary-simulation-e7babfe6aeb5e6a091lazye6a087e8aeb0efbc8ce58cbae997b4e69bb4e696b0efbc8ce58d95e782b9e69fa5e8afa2/<p><a href="http://vjudge.net/contest/131848#problem/A" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：给出一个长度为n的数列，每个位置是0或者1，给出q个操作，操作有两种类型，分别是将一段区间中反转，和询问当前某位置是0还是1</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-06-cf356a/Tue, 06 Sep 2016 19:19:11 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-06-cf356a/<blockquote><p><a href="http://codeforces.com/problemset/problem/356/A" target="_blank" rel="noreferrer">题目链接</a> 题意：现在有N个骑士进行M轮PK&hellip;现在告诉这M轮是谁站在台上&hellip;其将l~r所存在的骑士都打败..而若一个骑士被打败..就出局了..也就是不存在了&hellip;请输出每个骑士是被哪个骑士打败的(最后的胜利者输出0)&hellip;保证有解..</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-06-cf292e/Tue, 06 Sep 2016 13:57:54 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-06-cf292e/<p>x<a href="http://codeforces.com/problemset/problem/292/E" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：给出两个数组，每个数组n个数，分别为a和b,给出m个操作，操作有两种类型，第一种是给出x,y,k,表示从a数组的x坐标开始复制k个数到b数组的y到y+k-1。</p>