<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>单调栈 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E5%8D%95%E8%B0%83%E6%A0%88/</link><description>Recent content in 单调栈 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Wed, 03 Aug 2016 12:02:59 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%8D%95%E8%B0%83%E6%A0%88/index.xml" rel="self" type="application/rss+xml"/><item><title>poj 3494 Largest Submatrix of All 1’s (单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-poj-3494/</link><pubDate>Wed, 03 Aug 2016 12:02:59 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-poj-3494/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3494" target="_blank" rel="noreferrer"&gt;poj 3494&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出一个n*m个0-1图，求最大的全部由1组成的矩阵。&lt;/p&gt;</description></item><item><title>poj 2796 Feel Good (前缀和，单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-poj-2796/</link><pubDate>Wed, 03 Aug 2016 11:30:56 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-poj-2796/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2796" target="_blank" rel="noreferrer"&gt;poj 2796&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出一个人n（1E5）天的情绪值（0..1E6），一段时间的value的定义是这段时间的情绪之和*这段时间情绪的最小值。&lt;/p&gt;</description></item><item><title>poj 2082 Terrible Sets (前缀和，单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-po2082/</link><pubDate>Wed, 03 Aug 2016 11:07:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-po2082/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2082" target="_blank" rel="noreferrer"&gt;poj 2082 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：这道题简直就是。。。教给大家怎么把一句话把简单的题让人出得看不懂。。。真的一点意思都没有。给出n个矩形的宽度和高度，这些矩形并排顺次排列在x轴上，问最大面积。&lt;/p&gt;</description></item><item><title>poj 1964 City Game(单调栈，输入挂)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-poj-1964/</link><pubDate>Wed, 03 Aug 2016 10:42:29 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-03-poj-1964/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=1964" target="_blank" rel="noreferrer"&gt;poj 1964&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：n*m的maze,由&amp;rsquo;R&amp;rsquo;和‘F’组成，现在要求找到面积最大的矩形，使得矩形中所有格子都是&amp;rsquo;F&amp;rsquo;。&lt;/p&gt;</description></item><item><title>poj 3250 Bad Hair Day(单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-poj-3250/</link><pubDate>Tue, 02 Aug 2016 21:40:50 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-poj-3250/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3250" target="_blank" rel="noreferrer"&gt;poj 3250&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：&lt;/p&gt;
&lt;p&gt;n头牛排成一列，第n只牛在最前面，第1只牛在最后面。第i只牛能看到的牛的个数是，它前面的且没有被其他牛遮挡的牛的个数，遮挡的条件是高度大于或者相同。现在问所有牛能看到的牛的个数的和。&lt;/p&gt;</description></item><item><title>poj 2559 Largest Rectangle in a Histogram (单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-poj-2559/</link><pubDate>Tue, 02 Aug 2016 21:09:28 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-poj-2559/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2559" target="_blank" rel="noreferrer"&gt;poj 2559&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给定从左到右多个矩形，已知这此矩形的宽度都为1，长度不完全相等。这些矩形相连排成一排，求在这些矩形包括的范围内能得到的面积最大的矩形，求该面积。所求矩形可以横跨多个矩形，但不能超出原有矩形所确定的范围。&lt;/p&gt;</description></item><item><title>BZOJ 1660: [Usaco2006 Nov]Bad Hair Day 乱发节 (单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-04-15-bzoj-1660-usaco2006-novbad-hair-day-e4b9b1e58f91e88a82-e58d95e8b083e6a088/</link><pubDate>Fri, 15 Apr 2016 08:49:50 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-04-15-bzoj-1660-usaco2006-novbad-hair-day-e4b9b1e58f91e88a82-e58d95e8b083e6a088/</guid><description/></item><item><title>BZOJ 1657: [Usaco2006 Mar]Mooo 奶牛的歌声 (单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-04-15-bzoj-1657-usaco2006-marmooo-e5a5b6e7899be79a84e6ad8ce5a3b0-e58d95e8b083e6a088/</link><pubDate>Fri, 15 Apr 2016 08:07:59 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-04-15-bzoj-1657-usaco2006-marmooo-e5a5b6e7899be79a84e6ad8ce5a3b0-e58d95e8b083e6a088/</guid><description>&lt;h2 class="relative group"&gt;1657: [Usaco2006 Mar]Mooo 奶牛的歌声
 &lt;div id="1657-usaco2006-marmooo-奶牛的歌声" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#1657-usaco2006-marmooo-%e5%a5%b6%e7%89%9b%e7%9a%84%e6%ad%8c%e5%a3%b0" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 634  Solved: 447
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1657" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1657" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1657" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>BZOJ 1628: [Usaco2007 Demo]City skyline (单调栈)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-04-04-bzoj1628/</link><pubDate>Mon, 04 Apr 2016 08:47:38 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-04-04-bzoj1628/</guid><description>&lt;h2 class="relative group"&gt;1628: [Usaco2007 Demo]City skyline
 &lt;div id="1628-usaco2007-democity-skyline" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#1628-usaco2007-democity-skyline" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 396  Solved: 317
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1628" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1628" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1628" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>codeforces 442C. Artem and Array</title><link>https://111qqz.com/en/post/acm-icpc/2015/2015-07-28-cf442c/</link><pubDate>Tue, 28 Jul 2015 20:45:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2015/2015-07-28-cf442c/</guid><description>&lt;p&gt;C. Artem and Array&lt;/p&gt;
&lt;p&gt;time limit per test&lt;/p&gt;
&lt;p&gt;2 seconds&lt;/p&gt;
&lt;p&gt;memory limit per test&lt;/p&gt;
&lt;p&gt;256 megabytes&lt;/p&gt;
&lt;p&gt;input&lt;/p&gt;
&lt;p&gt;standard input&lt;/p&gt;
&lt;p&gt;output&lt;/p&gt;
&lt;p&gt;standard output&lt;/p&gt;
&lt;p&gt;Artem has an array of &lt;em&gt;n&lt;/em&gt; positive integers. Artem decided to play with it. The game consists of &lt;em&gt;n&lt;/em&gt; moves. Each move goes like this. Artem chooses some element of the array and removes it. For that, he gets &lt;em&gt;min&lt;/em&gt;(&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;) points, where &lt;em&gt;a&lt;/em&gt; and &lt;em&gt;b&lt;/em&gt; are numbers that were adjacent with the removed number. If the number doesn&amp;rsquo;t have an adjacent number to the left or right, Artem doesn&amp;rsquo;t get any points.&lt;/p&gt;</description></item></channel></rss>