알고리즘 기초 DP 문제 풀이 3, 4

dynamicProgramming/Code_11053.java

@@ -0,0 +1,49 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : ���� �� �����ϴ� �κ� ����
+ */
+public class Code_11053 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+
+		sc.nextLine();
+		//Scanner��ü�� num + eneter���� eneter�κ��� ���� nextLine()���� �б⶧����
+
+		String [] arr = sc.nextLine().split(" ");
+		int [] a = new int[num];
+
+		for(int i=0; i<num; ++i) {
+			a[i] = Integer.parseInt(arr[i]);
+		}
+
+		int [] d = new int[num];
+
+		d[0] = 1;
+
+		for(int i=1; i<num; ++i) { //���� d��ġ
+			for(int j=0; j<i; ++j) { // �� ���� d���̶� ���ϸ鼭 �ִ밪 ����
+				if(a[j]<a[i]) { //i��° �� > j��° ��
+					if(d[j]>d[i]) // i��° ���� < j��° ����
+						d[i]=d[j];
+				}
+			}
+			d[i] += 1; //���� �ڽű��� ���̿� ����
+		}
+
+		int max = 0;
+
+		for(int i : d)
+			if(max<i) 
+				max = i;
+
+		System.out.println(max);
+	}
+}

dynamicProgramming/Code_11054.java

@@ -0,0 +1,63 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : ���� �� ������� �κ� ����
+ */
+public class Code_11054 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+
+		int [] arr = new int[num];
+
+		int [] dp1 = new int[num]; //�����ϴ� �κ��� ���̸� ��Ÿ��
+		int [] dp2 = new int[num]; //�����ϴ� �κ��� ���̸� ��Ÿ��
+
+		for(int i=0; i<num; ++i) {
+			arr[i] = sc.nextInt();
+		}
+
+		int [] arr2 = arr;
+
+		//�ڱ� �ڽŵ� ���̿� �����ؾ��ϱ� ������ ù ��° ������ ���̴� 1
+		dp1[0]=1; 
+		dp2[num-1]=1;
+
+		//�����ϴ� �κ��� ���� ã�� 
+		for(int i=1; i<num; ++i) {
+			for(int j=0; j<i; ++j) {
+				if(arr[i]>arr[j])
+					if(dp1[i]<dp1[j])
+						dp1[i] = dp1[j];
+			}
+			dp1[i]+=1; 
+		}
+		for(int i=num-2; i>=0; --i) {
+			for(int j=num-1; j>=i+1; --j) {
+				if(arr2[i]>arr2[j])
+					if(dp2[i]<dp2[j])
+						dp2[i] = dp2[j];
+			}
+			dp2[i]+=1;
+		}
+
+		int max = 0;
+		int x = 0;
+
+		for(int i=0; i<num; ++i) {
+			x = dp1[i]+dp2[i];
+			if(x>max)
+				max = x;
+		}
+
+		System.out.println(max-1);
+
+
+	}
+}

dynamicProgramming/Code_11055.java

@@ -0,0 +1,49 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : ���� ū �����ϴ� �κ� ����
+ */
+public class Code_11055 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+
+		sc.nextLine();
+		//Scanner��ü�� num + eneter���� eneter�κ��� ���� nextLine()���� �б⶧����
+
+		String [] arr = sc.nextLine().split(" ");
+		int [] a = new int[num];
+
+		for(int i=0; i<num; ++i) {
+			a[i] = Integer.parseInt(arr[i]);
+		}
+
+		int [] d = new int[num];
+
+		d[0] = a[0];
+
+		for(int i=1; i<num; ++i) { //���� d��ġ
+			for(int j=0; j<i; ++j) { // �� ���� d���̶� ���ϸ鼭 �ִ밪 ����
+				if(a[j]<a[i]) { //i��° �� > j��° ��
+					if(d[j]>d[i]) // i��° ���� < j��° ����
+						d[i]=d[j];
+				}
+			}
+			d[i] += a[i]; //���� �ڽű��� ���̿� ����
+		}
+
+		int max = 0;
+
+		for(int i : d)
+			if(max<i) 
+				max = i;
+
+		System.out.println(max);
+	}
+}

dynamicProgramming/Code_11722.java

@@ -0,0 +1,49 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : ���� �� �����ϴ� �κ� ����
+ */
+public class Code_11722 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+
+		sc.nextLine();
+		//Scanner��ü�� num + eneter���� eneter�κ��� ���� nextLine()���� �б⶧����
+
+		String [] arr = sc.nextLine().split(" ");
+		int [] a = new int[num];
+
+		for(int i=0; i<num; ++i) {
+			a[i] = Integer.parseInt(arr[i]);
+		}
+
+		int [] d = new int[num];
+
+		d[num-1] = 1;
+
+		for(int i=num-2; i>=0; --i) {
+			for(int j=num-1; j>=i; --j) {
+				if(a[i]>a[j]) {
+					if(d[i]<d[j])
+						d[i] = d[j];
+				}
+			}
+			d[i] += 1;
+		}
+
+		int max = 0;
+
+		for(int i : d)
+			if(max<i) 
+				max = i;
+
+		System.out.println(max);
+	}
+}

dynamicProgramming/Code_1699.java

@@ -0,0 +1,33 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : �������� ��
+ */
+public class Code_1699 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int n = sc.nextInt();
+
+		int [] dp = new int[n+1];
+
+		//�̹� n���� ���� �ε������� ������ ���� �DZ����� �ʿ��� ���� �ּ� ������ �������.
+		for(int i=1; i<=n; ++i) {
+			dp[i] = i; //�� 1�� ���� �� i�� 
+
+			for(int j=1; j*j<=i; ++j) {
+				if(dp[i] > dp[i-j*j]+1) //�� : dp[i-25]+1 i-������ + 1  
+					dp[i] = dp[i-j*j]+1;
+			}
+		}
+
+		System.out.println(dp[n]);
+
+	}
+
+}

dynamicProgramming/Code_1912.java

@@ -0,0 +1,41 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : ������
+ */
+public class Code_1912 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+
+		int [] a = new int[num];
+		int [] dp = new int[num];
+
+		for(int i=0; i<num; ++i) {
+			a[i] = sc.nextInt();
+		}
+
+		dp[0] = a[0]; //a[1]�� ������ �ִ� ������ ��  , ��¼�� 1���ϱ�
+
+		for(int i=1; i<num; ++i) {
+			if(dp[i-1]+a[i]>a[i])
+				dp[i] = dp[i-1]+a[i];
+			else
+				dp[i] = a[i];
+		}
+
+		int max=dp[0];
+
+		for(int i=1; i<num; ++i)
+			if(max<dp[i])
+				max=dp[i];
+
+		System.out.println(max);
+	}
+}

dynamicProgramming/Code_2225.java

@@ -0,0 +1,35 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 10��
+ * �� �� : �պ���
+ */
+public class Code_2225 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		String [] s = sc.nextLine().split(" ");
+
+		int a = Integer.parseInt(s[0]);
+		int b = Integer.parseInt(s[1]);
+
+		long [][] dp = new long[b+1][a+1];
+
+		dp[0][0] = 1;
+
+		for(int k=1; k<=b; ++k) { //k�� ���ϱ�
+			for(int n=0; n<=a; ++n) {
+				for(int l=0; l<=n; ++l)
+				dp[k][n] += dp[k-1][n-l];
+				dp[k][n] %= 1000000000L;
+			}
+		}
+
+		System.out.println(dp[b][a]);
+	}
+
+}

dynamicProgramming/Code_2579.java

@@ -0,0 +1,40 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 09��
+ * �� �� : ��� ������
+ */
+public class Code_2579 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int n = sc.nextInt();
+
+		int [][] dp = new int[n][3];
+
+		int [] a = new int[n];
+
+		for(int i=0; i<n; ++i) {
+			a[i] = sc.nextInt();
+		}
+
+		dp[0][1] = a[0];
+		dp[0][2] = a[0];
+		dp[1][1] = a[1];
+		dp[1][2] = dp[0][1]+a[1];
+		//dp[0][1]=dp[0][2] , dp[1][1]=dp[1][2]
+		//�� ���� ���Ұ��� ���� ������ ���� ��  �� �� �ϳ��� ������ ���Ƿ� �� �پ� ���� ����
+
+		for(int i=2; i<n; ++i) {
+			dp[i][1] = Math.max(dp[i-2][1], dp[i-2][2]) + a[i];
+			dp[i][2] = dp[i-1][1] + a[i];
+		}
+
+		System.out.println(Math.max(dp[n-1][1], dp[n-1][2]));
+	}
+
+}