具体布局图如上:1-11个可选建筑位置(编号1-11)+中间1个固定建筑(未编号)。共计18条连续产生效果(a[0]-a[11],然后多次尝试之后,写出如下代码。
#include <iostream>
using namespace std;
int f = 1, y = 2, g = 3;
string jianzhuming[] = { "房子","娱乐","工厂" };
struct Zonghe
{
int renkou;
int chanchu;
int yule;
Zonghe(int renkou = 0, int chanchu = 0, int yule = 0) :renkou(renkou), chanchu(chanchu), yule(yule) {};
};
Zonghe operator +(const Zonghe& a, const Zonghe& b)
{
return Zonghe(a.renkou + b.renkou, a.chanchu + b.chanchu, a.yule + b.yule);
}
Zonghe jisuan(Zonghe z, int a, int b)
{
if (a == b)
{
if (a == f)
{
z.chanchu = 0;
z.yule = 0;
z.renkou = 0;
}
else
{
if (a == y)
{
z.chanchu = 0;