[Swust OJ 1139]--Coin-row problem

题目链接：  http://acm.swust.edu.cn/contest/0226/problem/1139/

There is a row of n coins whose values are some positive integers c₁, c₂,...,cn, not necessarily distinct. The goal is to pick up the maximum amount of money subject to the constraint that no two coins adjacent in the initial row can be picked up.

Description

Two lines, the first line is n (0< n <=10000), and the second line is value of coin(0< value <= 2^32).

Input

the maximum amount of money.

Output

1 2	6 5 1 2 10 6 2

Sample Input

1

17

Sample Output

Hint

Algorithm Text Book

 

题目大意：就是给你一排数字，不能够拿相邻的数字，问拿的数字的最大和为多少~~

 

思路：估计这老师才讲了dp 算法吧,这组题几乎全是dp（也是醉了）

不能够相邻那么就考虑当前位的前两个数对应的最好状态+当前数，和当前数的前一个数的状态比较，这里的边界dp[0]=0,dp[1]=x[1](x数据元素数组从1开始存贮)，

那么可以得到如下dp方程  dp[i] = max(dp[i - 1], dp[i - 2] + x[i]);

 

具体的看代码理解吧~~~

 

 #include <iostream>
 using namespace std;
 int n, dp[], i, x[];
 #define max(a,b) a>b?a:b
 int main()
 {
     cin >> n;
     for (i = ; i <= n; i++) cin >> x[i];
     dp[] = x[];
     for (i = ; i <= n; i++)
         dp[i] = max(dp[i - ], dp[i - ] + x[i]);
     cout << dp[n] << "\r\n";
     return ;
 }

dp就是这么牛逼，几行代码就整出了答案~~~