Home BOJ. Subsequence sum (1806)
Post
Cancel

BOJ. Subsequence sum (1806)

[Link] https://www.acmicpc.net/problem/1806


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
import java.util.*;
import java.io.*;

public class Main {
	static BufferedReader br;
	static int n = 0;
	static int[][] cost;
	static int[][] dp;
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		int[] arr = getArr();
		int n = arr[0], s = arr[1], min = 987654321;
		arr = getArr();
		int sum = 0;

		int left = 0, right = 0;
		while(left < n && right <= n) {
			if(sum < s) {
				if(right == n) break;
				sum += arr[right++];
			} else {
				while(sum >= s) {
					sum -= arr[left++];
				}
				min = Math.min(min, right - left + 1);
			}
		}

		print(min == 987654321 ? 0 : min);
	}

	static int toi(String s) { return Integer.parseInt(s); }
	static String[] getLine() throws IOException { return br.readLine().split(" "); }
	static int[] getArr() throws IOException { return Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); }
	static <T> void print(T s) { System.out.print(s); }
	static <T> void println(T s) { System.out.println(s); }
}
This post is licensed under CC BY 4.0 by the author.