목록전체 글 (683)
문제 풀이 및 개발 공간
[백준] 1275번 커피숍2 (gold 1
import java.io.*;import java.util.*;//세그먼트를 이용한 간단한 문제class SegTree{ long[] tree; public SegTree(int n){ int height=(int)Math.ceil(Math.log(n)/Math.log(2)); tree=new long[(int)Math.pow(2,height+1)]; } public long init(int node, long[] arr, int start, int end){ if(start==end){ return tree[node]=arr[start]; } else{ return tree[no..
[백준] 19941번 햄버거 분배 (silver 3
import java.io.*;import java.util.*;public class Main{ public static void main(String[] args)throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer st=new StringTokenizer(br.readLine()); int n=Integer.valueOf(st.nextToken()); int k=I..
[백준] 2578번 빙고 (silver 4
import java.io.*;import java.util.*;public class Main{ static int[][] map=new int[5][5]; static int complete=0; public static void main(String[] args) throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; for(int i=0; i=3 && answer==0){ answer=time; } } } ..
[백준] 23295번 스터디 시간 정하기 1 (gold 3
import java.io.*;import java.util.*;public class Main{ public static void main(String[] args) throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer st=new StringTokenizer(br.readLine()); int n=Integer.valueOf(st.nextToken()); int t=..
[백준] 14428번 수열과 쿼리 16 (gold 1
import java.io.*;import java.util.*;class Point{ int index; int num; public Point(int index, int num){ this.index=index; this.num=num; }}class SegTree{ public Point[] tree; public SegTree(int n){ int height=(int)Math.ceil(Math.log(n)/Math.log(2)); int treeSize=(int)Math.pow(2,height+1); tree=new Point[treeSize]; } public Point init(int n..
[백준] 1365번 꼬인 전깃줄 (gold 2
import java.io.*;import java.util.*;public class Main2{ static int[] dp; public static void main(String[] args) throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int n=Integer.valueOf(br.readLine()); StringTokenizer st=new StringTokenizer(br.readLine()); //간단하게 lis를 이용하면 풀리는 문제. //양 측이 n개씩 있는 상태에서 선이 꼬이면 안..