[백준 | Java Silver II] (#14246) K보다 큰 구간

문제

https://www.acmicpc.net/problem/14246

---

Issue

count와 sum을 int로 하면 틀렸다고 뜨고, long으로 바꿔주니까 맞았던 문제이다. 

 

첫번째 코드 - 실패, int 사용

package week14.baek.august13.baek;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class S14246 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }
        int k = Integer.parseInt(br.readLine());

        int count = 0;

        for (int start = 0; start < n; start++) {
            int sum = 0;
            for (int end = start; end < n; end++) {
                sum += arr[end];
                if(sum > k) {
//                    System.out.println("end = " + end + " start = " + start);
                    count += (n-end);

                    break;
                }
            }

        }

        System.out.println(count);
    }
}

 

 

최종 코드 - long으로 타입 변경

package week14.baek.august13.baek;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class S14246 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }
        int k = Integer.parseInt(br.readLine());

        long count = 0;

        for (int start = 0; start < n; start++) {
            long sum = 0;
            for (int end = start; end < n; end++) {
                sum += arr[end];
                if(sum > k) {
//                    System.out.println("end = " + end + " start = " + start);
                    count += (n-end);

                    break;
                }
            }

        }

        System.out.println(count);
    }
}