https://111qqz.com/en/tags/%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%E5%8C%BA%E9%97%B4%E5%92%8C/Recent content in 最大连续区间和 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzThu, 15 Sep 2016 21:51:33 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-15-bzoj-1756/Thu, 15 Sep 2016 21:51:33 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-15-bzoj-1756/<h2 class="relative group">1756: Vijos1083 小白逛公园 <div id="1756-vijos1083-小白逛公园" 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="#1756-vijos1083-%e5%b0%8f%e7%99%bd%e9%80%9b%e5%85%ac%e5%9b%ad" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 10 Sec  Memory Limit: 64 MB Submit: 1078  Solved: 353 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1756" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1756" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1756" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-15-hit-oj-2687-candy/Thu, 15 Sep 2016 21:04:48 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-15-hit-oj-2687-candy/<p><a href="http://acm.hit.edu.cn/hoj/problem/view?id=2687" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：给出n个数,m个修改，每次修改后询问整个区间的最大连续子段。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-12-25-cf327a/Fri, 25 Dec 2015 13:53:06 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-12-25-cf327a/<p><a href="http://codeforces.com/contest/327/problem/A" target="_blank" rel="noreferrer">http://codeforces.com/contest/327/problem/A</a> 题意：给定一段序列，只由0,1组成。要求选一段非空区间，做翻转操作（0变1,1变0），问变完之后1最多能有多少。 思路：最后的1个个数=初始的1的个数+变换区间的0的个数-变换区间的1的个数。初始的是常数。那么我们只要找到某一个区间内，0的个数-1的个数有最大值即可。如果a[i]==0的时候令b[i]=1，否则b[i]=0,那就是经典了最大连续区间和的问题了。dp的思想o(n)可以解决。</p>