<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>백준 13480 on 이왓슨 작업실</title><link>https://blog.js7777.party/tags/%EB%B0%B1%EC%A4%80-13480/</link><description>Recent content in 백준 13480 on 이왓슨 작업실</description><generator>Hugo</generator><language>ko-KR</language><lastBuildDate>Thu, 30 Jan 2025 22:47:52 +0900</lastBuildDate><atom:link href="https://blog.js7777.party/tags/%EB%B0%B1%EC%A4%80-13480/index.xml" rel="self" type="application/rss+xml"/><item><title>[백준 13480] Hard Cuts</title><link>https://blog.js7777.party/posts/44/</link><pubDate>Thu, 30 Jan 2025 22:47:52 +0900</pubDate><guid>https://blog.js7777.party/posts/44/</guid><description>&lt;p&gt;티어: 루4&lt;/p&gt;&#10;&lt;p&gt;&lt;a href="https://www.acmicpc.net/problem/13480" target="_blank" rel="noopener"&gt;https://www.acmicpc.net/problem/13480&lt;/a&gt;&lt;/p&gt;&#10;&lt;figure class="img"&gt;&lt;img src="https://blog.js7777.party/posts/44/img-01.png" alt="" loading="lazy" decoding="async" width="1728" height="1474"&gt;&lt;figcaption&gt;충격과 공포의 반례&lt;/figcaption&gt;&lt;/figure&gt;&lt;p&gt;처음에는 그리디로 풀려고 시도했었다. &lt;span class="katex"&gt;&lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;&lt;semantics&gt;&lt;mrow&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;/mrow&gt;&lt;annotation encoding="application/x-tex"&gt;w&lt;/annotation&gt;&lt;/semantics&gt;&lt;/math&gt;&lt;/span&gt;와 &lt;span class="katex"&gt;&lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;&lt;semantics&gt;&lt;mrow&gt;&lt;mi&gt;h&lt;/mi&gt;&lt;/mrow&gt;&lt;annotation encoding="application/x-tex"&gt;h&lt;/annotation&gt;&lt;/semantics&gt;&lt;/math&gt;&lt;/span&gt; 중 작은 값을 한 변으로 하는 정사각형을 채우고, 나머지 부분을 재귀로 다시 풀면 항상 최적의 해가 구해지는 줄 알았다. 그러나 문제점이 많았다.&lt;/p&gt;</description></item></channel></rss>