<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>torus711</author_name>
  <author_url>https://blog.hatena.ne.jp/torus711/</author_url>
  <blog_title>torus711 のアレ</blog_title>
  <blog_url>https://torus711.hatenablog.com/</blog_url>
  <categories>
    <anon>AtCoder</anon>
    <anon>スタック</anon>
    <anon>いもす法</anon>
  </categories>
  <description>問題文 https://atcoder.jp/contests/abc372/tasks/abc372_d 問題概要 $n$ 項からなる整数列 $H = \langle H_1, H_2, \dots, H_n \rangle$ が与えられる．各 $i$ ($1 \leq i \leq n$) について，次の条件を満たす $j$ ($i \begin{equation*} \max_{ k \in ( i, j ) } H_k \end{equation*} 制約 $1 \leq n \leq 2 \times 10^5$ $1 \leq H_i \leq n$ $i \neq j \Righ…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftorus711.hatenablog.com%2Fentry%2F2024%2F09%2F22%2F185250&quot; title=&quot;AtCoder Beginner Contest 372, D : Buildings - torus711 のアレ&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2024-09-22 18:52:50</published>
  <title>AtCoder Beginner Contest 372, D : Buildings</title>
  <type>rich</type>
  <url>https://torus711.hatenablog.com/entry/2024/09/22/185250</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
