Gym Commandos_a commando is a soldier of an elite light infantry-CSDN博客

本文链接：https://blog.csdn.net/zbspy_ZJF/article/details/78247565

本文介绍了一个三维动态规划问题的解决方法，该问题要求计算一个指挥官单位在一个10x10x10的酒店中能救出的最大数量的人质。通过从顶层到底层递归地计算每个房间的最大可救人质数，最终得出答案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A commando is a soldier of an elite light infantry often specializing in amphibious landings, abseiling or parachuting. This time our Commando unit wants to free as many hostages as it could from a hotel in Byteland, This hotel contains 10 identical floors numbered from 1 to 10 each one is a suite of 10 by 10 symmetric square rooms, our unit can move from a room (F, Y, X) to the room right next to it (F, Y, X + 1) or front next to it (F, Y + 1, X) and it can also use the cooling system to move to the room underneath it (F - 1, Y, X).

Knowing that our unit parachuted successfully in room 1-1 in floor 10 with a map of hostages locations try to calculate the maximum possible hostages they could save.

Input

Your program will be tested on one or more test cases. The first line of the input will be a single integer T. Followed by the test cases, each test case contains a number N (1 ≤ N ≤ 1, 000) representing the number of lines that follows. Each line contains 4 space separated integers (1 ≤ F, Y, X, H ≤ 10) means in the floor number F room Y-X there are H hostages.

Output

For each test case, print on a single line, a single number representing the maximum possible hostages that they could save.

Example

Input

Output

10
8

简单的三维dp

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

int s[15][15][15];

int Max(int a, int b, int c)
{
	if(b > a)
		a = b;
	if(c > a)
		a = c;
	return a;
}

int main()
{
	freopen("commandos.in","r",stdin);
	//freopen("standard output","w",stdout);
	int t, n;
	int f, y, x, h;
	cin>>t;
	while(t--)
	{
		memset(s,0,sizeof(s));
		cin>>n;
		while(n--)
		{
			cin>>f>>y>>x>>h;
			s[f][y][x] += h;
		}
		int i, j, k;
		for(i = 10;i > 0;i--)
		{
			for(j = 1;j <= 10;j++)
			{
				for(k = 1;k <= 10;k++)
				{
					s[i][j][k] = s[i][j][k] + Max(s[i+1][j][k], s[i][j-1][k], s[i][j][k-1]);
				}
			}
		}
		cout<<s[1][10][10]<<endl;
	}
	return 0;
}