結果

問題 No.1093 区間の和 / Sum of Range
ユーザー fairy_lettuce
提出日時 2020-06-24 01:52:16
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 5,019 bytes
コンパイル時間 880 ms
コンパイル使用メモリ 115,280 KB
実行使用メモリ 30,976 KB
最終ジャッジ日時 2024-07-03 19:42:29
合計ジャッジ時間 7,312 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;

namespace AtCoder.Contest.F
{
	static class Program
	{
		public static void Solve(Scanner cin)
		{
			int n = cin.ReadInt();
			int k = cin.ReadInt();
			var a = cin.ReadIntArray(n);
			int q = cin.ReadInt();

			int now = 0;
			for (int i = 0; i < k; i++)
			{
				now += a[i];
			}
			var l = new List<int>();
			l.Add(now);
			for (int i = 0; i < n - k; i++)
			{
				now += a[i + k];
				now -= a[i];
				l.Add(now);
			}
			l.Sort();
			for (int i = 0; i < q; i++)
			{
				Console.WriteLine(l.UpperBound(cin.ReadInt()));
			}
		}

		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);
			var cin = new Scanner();
			Solve(cin);
			Console.Out.Flush();
		}
	}

	static class BinarySearch
	{
		public static int UpperBound<T>(T[] array, T value) => UpperBound(array, 0, array.Length - 1, value, Comparer<T>.Default);

		public static int UpperBound<T>(T[] array, T value, Comparer<T> comparer) => UpperBound(array, 0, array.Length - 1, value, comparer);

		public static int UpperBound<T>(T[] array, int index, int length, T value) => UpperBound(array, index, length, value, Comparer<T>.Default);

		public static int UpperBound<T>(T[] array, int index, int length, T value, Comparer<T> comparer)
		{
			var l = index;
			var r = l + length - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(array[mid], value);
				if (res <= 0) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}

		public static int UpperBound<T>(this List<T> list, T item) => list.UpperBound(0, list.Count, item, Comparer<T>.Default);

		public static int UpperBound<T>(this List<T> list, T item, Comparer<T> comparer) => list.UpperBound(0, list.Count, item, comparer);

		public static int UpperBound<T>(this List<T> list, int index, int count, T item, Comparer<T> comparer)
		{
			var l = index;
			var r = l + count - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(list[mid], item);
				if (res <= 0) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}

		public static int LowerBound<T>(T[] array, T value) => LowerBound(array, 0, array.Length - 1, value, Comparer<T>.Default);

		public static int LowerBound<T>(T[] array, T value, Comparer<T> comparer) => LowerBound(array, 0, array.Length - 1, value, comparer);

		public static int LowerBound<T>(T[] array, int index, int length, T value) => LowerBound(array, index, length, value, Comparer<T>.Default);

		public static int LowerBound<T>(T[] array, int index, int length, T value, Comparer<T> comparer)
		{
			var l = index;
			var r = l + length - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(array[mid], value);
				if (res == -1) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}

		public static int LowerBound<T>(this List<T> list, T item) => list.LowerBound(0, list.Count, item, Comparer<T>.Default);

		public static int LowerBound<T>(this List<T> list, T item, Comparer<T> comparer) => list.LowerBound(0, list.Count, item, comparer);

		public static int LowerBound<T>(this List<T> list, int index, int count, T item, Comparer<T> comparer)
		{
			var l = index;
			var r = l + count - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(list[mid], item);
				if (res == -1) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}
	}

	class Scanner
	{
		string[] s;
		int i;

		char[] cs = new char[] { ' ' };

		public Scanner()
		{
			s = new string[0];
			i = 0;
		}

		public string Read() => ReadString();

		public string ReadString()
		{
			if (i < s.Length) return s[i++];
			string st = Console.ReadLine();
			while (st == "") st = Console.ReadLine();
			s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
			if (s.Length == 0) return ReadString();
			i = 0;
			return s[i++];
		}

		public string[] ReadStringArray(int N)
		{
			string[] Array = new string[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadString();
			}
			return Array;
		}

		public int ReadInt()
		{
			return int.Parse(ReadString());
		}

		public int[] ReadIntArray(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadInt() + add;
			}
			return Array;
		}

		public long ReadLong()
		{
			return long.Parse(ReadString());
		}

		public long[] ReadLongArray(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadLong() + add;
			}
			return Array;
		}

		public double ReadDouble()
		{
			return double.Parse(ReadString());
		}

		public double[] ReadDoubleArray(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadDouble() + add;
			}
			return Array;
		}

		public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1));
	}
}
0