#788005 (D) No.2036 Max Middle

• 問題: No.2036 Max Middle
• ユーザー: daut-dlang
• 提出日時: 2022-08-12 22:26:39
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,858 bytes
• コンパイル時間: 1,277 ms
• コンパイル使用メモリ: 110,600 KB
• 実行使用メモリ: 14,036 KB
• 最終ジャッジ日時: 2023-09-04 18:06:40
• 合計ジャッジ時間: 2,561 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	1 ms; 4,380 KB
testcase_04	AC	2 ms; 4,376 KB
testcase_05	AC	1 ms; 4,380 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	1 ms; 4,380 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	54 ms; 13,888 KB
testcase_17	WA	-
testcase_18	AC	31 ms; 12,628 KB
testcase_19	AC	32 ms; 12,568 KB
testcase_20	WA	-

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
T euDist2(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return c.sum; }
double euDist(T)(T[] a, T[] b) { return sqrt(cast(double)euDist2(a,b)); }
double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }
double norm(double[] vec) { return sqrt(reduce!((a,b)=>a+b*b)(0.0, vec)); }
double dotProd(double[] a, double[] b) { auto r = a.dup; r[] *= b[]; return r.sum; }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto A = RDA;

	long[] arr;
	if (A[0] < A[1])
		arr ~= 0;
	foreach (i; 1..N-1)
	{
		if (A[i] < A[i-1] && A[i] < A[i+1])
			arr ~= i;
		else if (A[i] > A[i-1] && A[i] > A[i+1])
			arr ~= i;
	}
	if (A[N-1] < A[N-2])
		arr ~= N-1;

	long ans;
	foreach (i; 0..arr.length)
	{
		if (i % 2 == 0) continue;

		auto l = arr[i] - arr[i-1];
		auto r = arr[i+1] - arr[i];
		auto x = min(l, r);
		auto y = max(l, r);
		
		ans += x * x;
		ans += y - x;
		arr[i+1] = l < r ? arr[i+1] - x : arr[i-1] + x;
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}