존못코딩

#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <stdlib.h>
#include <queue>
#include <memory.h>
using namespace std;
 
#define ll long long
 
ll dp[11][11][11][11][11][6][6];
int cnt[6], n, s;

ll dy(int a, int b, int c, int d, int e, int pre, int ppre)
{
	if (a + b + c + d + e == s)return 1;
	ll &ret = dp[a][b][c][d][e][pre][ppre];
	if (ret != -1)return ret;

	ret = 0;

	if (cnt[1] > a && pre != 1 && ppre != 1)ret += dy(a + 1, b, c, d, e, 1, pre);
	if (cnt[2] > b&& pre != 2 && ppre != 2)ret += dy(a, b + 1, c, d, e, 2, pre);
	if (cnt[3] > c&& pre != 3 && ppre != 3)ret += dy(a, b, c + 1, d, e, 3, pre);
	if (cnt[4] > d&& pre != 4 && ppre != 4)ret += dy(a, b, c, d + 1, e, 4, pre);
	if (cnt[5] > e&& pre != 5 && ppre != 5)ret += dy(a, b, c, d, e + 1, 5, pre);

	return ret;
}

int main()
{
	scanf("%d", &n); 
	for (int i = 1; i <= n; i++) {
		scanf("%d", &cnt[i]);
		s += cnt[i];
	}
	memset(dp, 0xff, sizeof(dp));
	printf("%lld\n", dy(0, 0, 0, 0, 0, 0, 0));
} 

#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <stdlib.h>
#include <queue>
#include <memory.h>
using namespace std;
  
int n, m;
int a[502][502];
int dp[502][502];
  
const int ud[4] = { -1,1,0,0 };
const int lr[4] = { 0,0,-1,1 };
  
int dy(int i, int j)
{
    int &ret = dp[i][j];
    if (ret != -1)return ret;
    ret = 0;
    for (int w = 0; w < 4; w++) {
        int x = i + ud[w], y = j + lr[w];
        if (x < 1 || x>n || y<1 || y>n)continue;
        if (a[i][j] > a[x][y])ret = max(ret, 1 + dy(x, y));
    }
    return ret = (ret == 0 ? 1 : ret);
}
int main()
{
    int M = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)for (int j = 1; j <= n; j++)scanf("%d", &a[i][j]);
    memset(dp, 0xff, sizeof(dp));
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            if (dp[i][j] == -1)M = max(M, dy(i, j));
        }
    printf("%d\n", M);
}