griefworker https://blog.hatena.ne.jp/griefworker/ present https://tnakamura.hatenablog.com/ .NET C# 競技プログラミング atcoder.jp 動的計画法の復元で解く。 var N = int.Parse(Console.ReadLine()!); var h = Console.ReadLine()!.Split(' ', StringSplitOptions.RemoveEmptyEntries).Select(int.Parse).ToArray(); // 動的計画法を使って、支払うコストの総和の最小を求める var dp = new int[N]; for (var i = 0; i < N; i++) { if (i == 0) { dp[i] = 0; } else if (i == 1) { dp… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftnakamura.hatenablog.com%2Fentry%2F2026%2F09%2F30%2Fb17" title="B17 - Frog 1 with Restoration - present" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2026-09-30 17:30:00 rich https://tnakamura.hatenablog.com/entry/2026/09/30/b17 1.0 100%