hdu2845(第四次D)

Bean-eating is an interesting game, everyone owns an MN matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 11 grid. Now you want to eat the beans and collect the qualities, but everyone must obey by the following rules: if you eat the bean at the coordinate(x, y), you can’t eat the beans anyway at the coordinates listed (if exiting): (x, y-1), (x, y+1), and the both rows whose abscissas are x-1 and x+1.

Now, how much qualities can you eat and then get ?
Input
There are a few cases. In each case, there are two integer M (row number) and N (column number). The next M lines each contain N integers, representing the qualities of the beans. We can make sure that the quality of bean isn’t beyond 1000, and 1<=M*N<=200000.
Output
For each case, you just output the MAX qualities you can eat and then get.

解：选一行时上下两行不能选，同一行相邻的不能选，只要先算出一行的最大值，再算出选哪几行最大就可以了。

cin要改成scanf，否则会不够快

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int m, n;
	while (cin >> m >> n)
	{
		int a[3000] = { 0 };
		int b[3000] = { 0 };
		for (int i = 1; i <= m; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				scanf_s("%d", a + j);
			}
			for (int j = 2; j <= n; j++)
			{
				a[j] = max(a[j - 2] + a[j], a[j - 1]);
			}
			b[i] = a[n];
		}
		for (int j = 2; j <= m; j++)
		{
			b[j] = max(b[j - 2] + b[j], b[j - 1]);
		}
		cout << b[m] << endl;
	}
	return 0;
}