hades

[Baekjoon] 11659๋ฒˆ: ๊ตฌ๊ฐ„ ํ•ฉ ๊ตฌํ•˜๊ธฐ ๋ณธ๋ฌธ

๐Ÿ‘Š PS/Algorithm

[Baekjoon] 11659๋ฒˆ: ๊ตฌ๊ฐ„ ํ•ฉ ๊ตฌํ•˜๊ธฐ

hades1 2024. 7. 25. 20:12

๐Ÿฅ… ๋ฌธ์ œ

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

 

๐Ÿ” ์„ค๊ณ„

i๋ฒˆ์งธ๋ถ€ํ„ฐ j๋ฒˆ์งธ๊นŒ์ง€์˜ ํ•ฉ์€ j๋ฒˆ์งธ๊นŒ์ง€์˜ ๋ˆ„์  ํ•ฉ์—์„œ i-1๋ฒˆ์งธ๊นŒ์ง€์˜ ๋ˆ„์  ํ•ฉ์„ ๋นผ๋ฉด ๋œ๋‹ค.

 

์ฃผ์˜ํ•  ๊ฒƒ์€ ๋ฐฐ์—ด์€ 0๋ถ€ํ„ฐ ์‹œ์ž‘ํ•˜์ง€๋งŒ, ์ž…๋ ฅ์œผ๋กœ ๋“ค์–ด์˜ค๋Š” ๊ฒƒ์€ ๋ช‡ ๋ฒˆ์งธ์— ๋Œ€ํ•œ ์ •๋ณด์ด๋ฏ€๋กœ 1๋ถ€ํ„ฐ ์‹œ์ž‘ํ•œ๋‹ค.

 

๐Ÿ‘Š ํ’€์ด

package hades.ps;

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n, m;
        n = sc.nextInt();
        m = sc.nextInt();

        int[] arr = new int [n+1];
        for (int k=1; k<=n; k++){
            arr[k] = sc.nextInt();
        }

        int[] sum = new int [n+1];
        for (int k=1; k<=n; k++){
            sum[k] = sum[k-1] + arr[k];
        }

        int i, j;
        for (int k=0; k<m; k++){
            i = sc.nextInt();
            j = sc.nextInt();
            System.out.println(sum[j] - sum[i-1]);
        }
    }
}