Submission #2872971

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;

namespace AtCorder
{
	public class Program
	{
		public static void Main()
		{
			int n = int.Parse(ReadLine());
			var list = ReadLine().Split().Select(x => int.Parse(x))
				.ToList();

			// 累積和を使う
			var sum = new List<double>();
			sum.Add(list[0]);
			for (int i = 1; i < n; i++)
			{
				sum.Add(sum[i - 1] + list[i]);
			}

			double ans = double.MaxValue;
			var list2 = new double[4];
			// 中央の区切りは全探索
			for (int i = 1; i < n - 2; i++)
			{
				var min = double.MaxValue;
				for (int j = 0; j < i; j++)
				{
					var a = sum[j];
					var b = sum[i] - sum[j];
					var d = Math.Abs(a - b);
					if (d > min)
					{
						break;
					}
					list2[0] = a;
					list2[1] = b;
					min = d;
				}
				min = double.MaxValue;
				for (int j = i + 1; j < n; j++)
				{
					var a = sum[j] - sum[i];
					var b = sum[n - 1] - sum[j];
					var d = Math.Abs(a - b);
					if (d > min)
					{
						break;
					}
					list2[2] = a;
					list2[3] = b;
					min = d;
				}

				ans = Math.Min(ans, list2.Max() - list2.Min());
			}

			WriteLine(ans);
		}
	}
}

Submission Info

Judge Result