구르는 돌에는 이끼가 끼지 않는다

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

package com.ji.beakjoon.dp;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

/**
 * 구간합구하기5
 * @author ji
 *
 */
public class IntervalSum5 {
	
	public static void main(String[] args) throws IOException {
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String[] sizeSumCountStr = br.readLine().split(" ");
		int gridSize = Integer.valueOf(sizeSumCountStr[0]);
		int sumCount = Integer.valueOf(sizeSumCountStr[1]);

		int[][] numbersMap = new int[gridSize+1][gridSize+1];
		int[][] dp = new int[gridSize+1][gridSize+1];


		for (int i = 1; i <= gridSize; i++) {
			String[] points = br.readLine().split(" ");
			for (int j = 1; j <= gridSize; j++) {
				numbersMap[i][j] = Integer.valueOf(points[j-1]);
				//dp안에 0,0부터 특정 배열까지의 값들은 더해 놓음!!!
				dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp [i-1][j-1] + numbersMap[i][j];

			}
		}

		for (int k = 1; k <= sumCount; k++) {
			String[] points = br.readLine().split(" ");
			int x1 = Integer.valueOf(points[0]);
			int y1 = Integer.valueOf(points[1]);
			int x2 = Integer.valueOf(points[2]);
			int y2 = Integer.valueOf(points[3]);

			//마지막 포인트 합에서 이전 포인트의 값들을 빼줌!!!
			int sum=dp[x2][y2] - dp[x2][y1-1] - dp[x1-1][y2] + dp[x1-1][y1-1];

			bw.write(String.valueOf(sum) + "\n");
		}

		br.close();
		bw.flush();
		bw.close();
	}

}

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

package com.ji.beakjoon.dp;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

/**
 * 동전1
 * @author ji
 *
 */
public class Coin1 {

	static int[] dp;
	static int[] coinTypes;
	public static void main(String[] args) throws IOException {
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String[] condition = br.readLine().split(" ");
		int coinType = Integer.valueOf(condition[0]);
		int targetNum = Integer.valueOf(condition[1]);
		
		coinTypes = new int[coinType+1];
		dp = new int[targetNum + 1];
		dp[0] = 1;
		
		for(int i=1; i <= coinType; i++) {
			coinTypes[i] = Integer.valueOf(br.readLine());
			for(int j=coinTypes[i]; j <= targetNum; j++) {
				//dp 안에 각 동전 금액에 따라서 targetNumber가 되는 과정을 dp에 저장하여 처리
				dp[j] += dp[j - coinTypes[i]];
			}
		}
		
		bw.write(String.valueOf(dp[targetNum]));
		
		br.close();
		bw.flush();
		bw.close();
		
	}
	
}

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

package com.ji.beakjoon.dfs;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

/**
 * 안전 영역 
 * @author ji
 *
 */
public class SafeZoneDfs {

	static int[][] safeZoneMap;//안전구역 정보
	static int safeZoneMapSize = 0; //안전구역 맵 크기
	static boolean[][] DFSisVisited;
	static List<Integer> list;//각 수위 경계값에 따른 결과 값 저장
	static int[] dx = {1, -1, 0, 0}; //상하좌우위아래
	static int[] dy = {0, 0, 1, -1}; 
	public static void main(String[] args) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

		safeZoneMapSize = Integer.valueOf(br.readLine()); // 행렬 가로 길이
		safeZoneMap = new int[safeZoneMapSize][safeZoneMapSize];
		DFSisVisited = new boolean[safeZoneMapSize][safeZoneMapSize];
		
		int max = 0;
		for (int i = 0; i < safeZoneMapSize; i++) {
			String[] complexGraphInfo = String.valueOf(br.readLine()).split(" ");
			for (int j = 0; j < safeZoneMapSize; j++) {
				safeZoneMap[i][j] = Integer.valueOf(complexGraphInfo[j]);
				if(max < safeZoneMap[i][j])
					max = safeZoneMap[i][j];
			}
		}
		
		list = new ArrayList<>();
		
		for(int depth=0; depth<=max ; depth++) {
			int cnt = 0; 
			for (int i = 0; i < safeZoneMapSize; i++) {
				for (int j = 0; j < safeZoneMapSize; j++) {
					if(safeZoneMap[i][j] > depth && !DFSisVisited[i][j]) {
						cnt++;
						dfs(i, j, depth);
					}
					
				}
			}
			
			//dfs 방문정보 초기화!!!!
			for(boolean a[]:DFSisVisited)
				Arrays.fill(a, false);
			list.add(cnt);
		}
		
		int maxResult = Collections.max(list);
		bw.write(String.valueOf(maxResult) );

		br.close();
		bw.flush();
		bw.close();

	}

	public static void dfs(int x, int y, int depth) {
		DFSisVisited[x][y] = true;
		
		for(int i=0; i < 4; i++) {
			int nx = x + dx[i];
			int ny = y + dy[i];
			
			if(nx >=0 && ny >=0 && nx < safeZoneMap.length && ny< safeZoneMap.length) {
				if(safeZoneMap[nx][ny] > depth && !DFSisVisited[nx][ny])
					dfs(nx, ny, depth);
			}
			
		}

	}

}