uva 10285 最长的滑雪路径（动态规划水题）



求矩阵中最长递减路径的长度

#include<cstdio>  
#include<cstring>  
#include<cmath>  
#include<cstdlib>  
#include<iostream>  
#include<algorithm>  
#include<vector>  
#include<map>  
#include<queue>  
#include<stack> 
#include<string>
#include<map> 
#include<set>
#define eps 1e-6 
#define LL long long  
using namespace std;  

const int maxn = 100 + 5;
const int INF = 0x3f3f3f3f;
const int dx[] = {0, -1, 0, 1};
const int dy[] = {1, 0, -1, 0};
int r, c;
int G[maxn][maxn], d[maxn][maxn];
string name;


int dp(int x, int y) {
	if(d[x][y] != -1) return d[x][y];
	d[x][y] =