动态规划之Money Robbing

动态规划之Money Robbing

  今天解决一道动态规划的问题，这道题目的状态转移方程不是特别难想到，但是真正实现起来也并不是很简单。

题目：Money Robbing

  A robber is planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

  Given a list of non-negative integers representing the amount of money of each house,determine the maximum amount of money you can rob tonight without alerting the police.
  首先我们来看一下状态转移方程：robbing[j]=max(robbing[j-1],robbing[j-2]+mon[j]);这里的mon数组我们用来存放钱，robbing数组用来保留当前抢的钱数。
  简单看一下迭代的过程：首先当mon只有一个元素时，肯定就取这个元素；当mon有两个元素时，就取两个里面的较大数；当mon多于两个元素时，我们看下图的迭代过程：


源代码：

/*date:2019年11月14日
  Author:Chauncy_xu*/
  #include<iostream>
  using namespace std;
  int main()
  {
      int n;
      cin>>n;
      int money[n];
      int rob(int mon[],int);
      for(int i=0;i<n;i++)
      {
          cin>>money[i];
      }
      cout<<rob(money,n);
      return 0;
  }
  int rob(int mon[],int m)
  {
        int robbing[m];
        if (m==1)
            return mon[0];
        else if(m==2)
            return max(mon[0],mon[1]);
        else
        {
            robbing[0]=mon[0];
            robbing[1]=max(mon[0],mon[1]);
            for(int j=2;j<m;j++)
            {
            robbing[j]=max(robbing[j-1],robbing[j-2]+mon[j]);
            }
            return robbing[m-1];
        }
  }

不足之处，请多指教。