19-20 동계 모각코 동아리 4회차 결과

package bj;



import java.util.*;

public class bj_1912 {



	public static void main(String[] args) {

		// TODO Auto-generated method stub

		Scanner scan = new Scanner(System.in);

		int n = scan.nextInt();

		int[] ans = new int[n];

		int[] d = new int[n];

		//String[] tmp = (scan.nextLine()).split(" ");

		int r = -9999;

	

		for(int i = 0; i<n; i++)

		{

			d[i] = scan.nextInt();

		}

		

		ans[0] = d[0];

		

		for(int i = 1; i<n; i++)

		{

			ans[i] = Math.max(ans[i-1]+d[i], d[i]);

		}

		

		for(int i = 0; i<n; i++)

		{

			r = Math.max(ans[i], r);

		}

		System.out.println(r);

	}



}

Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int[] d = new int[n+1];

        for (int i=1; i<=n; i++) {

            d[i] = i;

            for (int j=1; j*j <= i; j++) {

                if (d[i] > d[i-j*j] + 1) {

                    d[i] = d[i-j*j] + 1;

                }

            }

        }

        System.out.println(d[n]);

int n = scan.nextInt();

		int k = scan.nextInt();



		double[][] d = new double[k + 1][n + 1];

		d[0][0] = 1;

		for (int i = 1; i <= k; i++) {

			for (int j = 0; j <= n; j++) {

				for (int l = 0; l <= j; l++) {

					d[k][n] += d[k - 1][j - l];

				}

			}

		}