<?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%88%86%E7%B1%BB%E8%AE%A8%E8%AE%BA/</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, 18 May 2016 07:47:48 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%88%86%E7%B1%BB%E8%AE%A8%E8%AE%BA/index.xml" rel="self" type="application/rss+xml"/><item><title>poj 3368 Frequent values （暴力+rmq，分类讨论）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-05-18-poj3368/</link><pubDate>Wed, 18 May 2016 07:47:48 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-05-18-poj3368/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3368" target="_blank" rel="noreferrer"&gt;poj 3368 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个非减的数a[i],求区间[l,r]中出现次数最多的数的出现的次数。&lt;/p&gt;</description></item></channel></rss>