洛谷P1990 覆盖墙壁进阶解法

#include<iostream>

using namespace std;
int a[1000001], b[1000001], N;

int main()
{
	cin >> N;
	a[1] = 1;
	b[1] = 1;
	a[2] = 2;
	b[2] = 2;
	for (int i = 3; i <= N; i++)
	{
		a[i] = (a[i - 1] + 2 * b[i - 2] + a[i - 2]) % 10000;
		b[i] = (a[i - 1] + b[i - 1]) % 10000;
	}
	cout << a[N];
	return 0;
}