Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -0,0 +1,56 @@
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class BOJ_18353_병사배치하기 {
static int N, H;
static int[] D;
static int[] input;

public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());

D = new int[N];
input = new int[N];

st = new StringTokenizer(br.readLine());
for(int i = 0; i < N; i++) {
input[i] = Integer.parseInt(st.nextToken());
}

Arrays.fill(D, 1);

int ans = 0;
for(int i = N - 2; i >= 0; i--) {
for(int j = N - 1; j > i; j--) {
if(input[i] > input[j]) {
D[i] = Math.max(D[i], D[j] + 1);
//D[i] = input[i];
}
}
}

// for(int i = 0; i < N; i++) {
// bw.write(D[i] + " ");
// }

int max = Integer.MIN_VALUE;
for(int i = 0; i < N; i++) {
max = Math.max(max, D[i]);
}

ans = N - max;

bw.write(ans + "\n");

bw.flush();
br.close();
bw.close();
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class BOJ_20152_GameAddiction {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());

long dp[][] = new long[N + 1][M + 1];

dp[1][1] = 1;

for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
if(i == 1 && j == 1){
continue;
}

dp[i][j] = (dp[i][j-1] + dp[i-1][j]+ dp[i-1][j-1]) % 1000000007;
}
}

System.out.println(dp[N][M]%1000000007);

br.close();
}
}
1 change: 1 addition & 0 deletions 11월/1주차/BOJ_1541_잃어버린괄호
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@

60 changes: 60 additions & 0 deletions 11월/3주차/BOJ_1541_잃어버린 괄호/ohwootaek
Original file line number Diff line number Diff line change
@@ -0,0 +1,60 @@
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Main {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

StringTokenizer st = new StringTokenizer(br.readLine());
// 55-50+40
String temp = st.nextToken();

boolean flag = temp.contains("-");

int sum = 0;

if(flag){
String number[] = temp.split("-");

// sum = Integer.parseInt(number[0]);
int i = 0;

for(String num : number){
if(i++ == 0){
String fir[] = num.split("\\+");
for(String s : fir){
sum += Integer.parseInt(s);
}
continue;
}
String n[] = num.split("\\+");

if(num.length() < 5 && n.length == 1){ // 1자리 숫자일때만
sum -= Integer.parseInt(num);
}else{
String split[] = num.split("\\+");
for(String s : split){
sum -= Integer.parseInt(s);
}
}
}
}else{
String split[] = temp.split("\\+");
for(String s : split){
sum += Integer.parseInt(s);
}
}

bw.write(sum + "\n");

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