Main.java

package TimeComplexity.P1806;

import java.io.*;
import java.util.*;

public class Main {

    static int N, S;
    static int[] nums;
    static int ans = 0;

    public static void main(String[] args) throws Exception {
        System.setIn(new FileInputStream("src/TimeComplexity/P1806/input.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        N = Integer.parseInt(st.nextToken());
        S = Integer.parseInt(st.nextToken());

        nums = new int[N];
        st = new StringTokenizer(br.readLine());
        for (int i = 0; i < N; i++) {
            nums[i] = Integer.parseInt(st.nextToken());
            if (nums[i] == S) ans = 1;
            if (i > 0) nums[i] += nums[i-1];
        }

        if (ans != 1) {
            int low = 0;
            int high = 1;
            while (high < N && low < high) {
                long sum;
                if (low == 0) sum = nums[high];
                else sum = nums[high] - nums[low-1];
                if (sum >= S) {
                    if (ans == 0) ans = high - low + 1;
                    else ans = Math.min(ans, high - low + 1);
                    if (ans == 2) break;
                    low ++;
                } else {
                    high ++;
                }
            }
        }

        System.out.println(ans);
    }
}