목록전체 글 (601)
sm 기술 블로그
import sys input = sys.stdin.readline N = int(input()) stair = list(int(input()) for _ in range(N)) dp = [] try: dp.append(stair[0]) #dp[0] dp.append(max(stair[0]+stair[1], stair[1])) #dp[1] dp.append(max(stair[0]+stair[2], stair[1]+stair[2])) #dp[2] for i in range(3, N): dp.append(max(dp[i-3]+stair[i-1]+stair[i], dp[i-2]+stair[i])) except: sum = 0 for val in stair: sum += val dp.append(sum) pri..
import java.util.*; import java.io.*; class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); ArrayList[] triangle = new ArrayList[N]; for (int i = 0; i < N; i++) { triangle[i] = new ArrayList(); } for (int i = 0; i < N; i++) { String[] tmp = br.readLine().split(" "..
import sys input = sys.stdin.readline N = int(input()) triangle = [list(map(int,input().split())) for _ in range(N)] sum = 0 result = [] for i in range(1,N): for j in range(0,i+1): if(i == 1): triangle[i][j] += triangle[0][0] continue if(j == 0): triangle[i][j] += triangle[i-1][0] continue if(j == i): triangle[i][j] += triangle[i-1][j-1] continue triangle[i][j] += max(triangle[i-1][j-1],triangle..
import java.util.*; import java.io.*; class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int[][] num = new int[N][3]; for (int i = 0; i < N; i++) { String[] tmp = br.readLine().split(" "); num[i][0] = Integer.parseInt(tmp[0]); num[i][1] = Integer.parseInt(tmp[1..