- C++
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include<cstdio>
#include<algorithm>
int a[301],dp[301];
using namespace std;
int main(void)
{
int x;
scanf("%d", &x);
for (int i=1; i<=x; i++) scanf("%d", &a[i]);
dp[0]=0;
dp[1]=a[1];
dp[2]=a[1]+a[2];
for (int i=3; i<=x; i++)
dp[i]=max(dp[i-2]+a[i], dp[i-3]+a[i-1]+a[i]);
printf("%d", dp[x]);
return 0;
}
|
cs |
- JAVA
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
public class Main{
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
int n = Integer.parseInt(br.readLine());
int[] arr = new int[n+1];
int[] dp = new int[n+1];
for(int i=1; i<=n; i++){
arr[i] = Integer.parseInt(br.readLine());
}
dp[1]=arr[1];
if(n>=2) { dp[2] = Math.max(dp[1]+arr[2], arr[2]);}
if(n>=3){
for(int i=3; i<=n; i++){
dp[i] = Math.max(dp[i-2]+arr[i], dp[i-3]+arr[i-1]+arr[i]);
}
}
System.out.println(dp[n]);
}
}
|
cs |
'백준 2 > DP' 카테고리의 다른 글
| [백준 10844] 쉬운 계단 수 (0) | 2020.12.07 |
|---|---|
| [백준 1932] 정수 삼각형 (C++/Java) (0) | 2020.12.07 |
| [백준 11727] 2xN 타일링 2 (0) | 2020.12.07 |
| [백준 11726] 2xN 타일링 (C++/Java) (0) | 2020.12.07 |
| [백준 1463] 1로 만들기 (C++/Java) (0) | 2020.12.07 |