HDOJ 1078 FatMouse and Cheese

题意：在一个迷宫中，一个老鼠在(0,0)，每一步可以走k格(<=k)，并且每一步的格子中的值要比前一步大，求使得得到的格子中值的和最大

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1078

思路：LIS的变形，转化为二维，通过优先队列优化的搜索进行查找最优解，dp[x][y]当前路径到这个点的最大值

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
13681313	2015-05-12 22:18:01	Accepted	1078	265MS	2392K	3779 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
//#include <unordered_map>
//#include <unordered_set>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define RDI(a) scanf ( "%d", &a )
#define RDII(a, b) scanf ( "%d%d", &a, &b )
#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )
#define RS(s) scanf ( "%s", s )
#define PI(a) printf ( "%d", a )
#define PIL(a) printf ( "%d\n", a )
#define PII(a,b) printf ( "%d %d", a, b )
#define PIIL(a,b) printf ( "%d %d\n", a, b )
#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )
#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )
#define PL() printf ( "\n" )
#define PSL(s) printf ( "%s\n", s )
#define rep(i,m,n) for ( int i = m; i <  n; i ++ )
#define REP(i,m,n) for ( int i = m; i <= n; i ++ )
#define dep(i,m,n) for ( int i = m; i >  n; i -- )
#define DEP(i,m,n) for ( int i = m; i >= n; i -- )
#define repi(i,m,n,k) for ( int i = m; i <  n; i += k )
#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )
#define depi(i,m,n,k) for ( int i = m; i >  n; i += k )
#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
template <class T>
inline bool RD ( T &ret )
{
    char c;
    int sgn;
    if ( c = getchar(), c ==EOF )return 0; //EOF
    while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar();
    sgn = ( c == '-' ) ? -1 : 1;
    ret = ( c == '-' ) ? 0 : ( c - '0' );
    while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' );
    ret *= sgn;
    return 1;
}
inline void PD ( int x )
{
    if ( x > 9 ) PD ( x / 10 );
    putchar ( x % 10 + '0' );
}
const double eps = 1e-10;
const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };
struct node{
    int x, y, cnt;
    node(){}
    node( int _x, int _y ) : x(_x), y(_y) {}
    node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}
    friend bool operator < ( const node &a, const node &b ){
        return a.cnt > b.cnt;
    }
};
int k, n;
int adj[105][105];
int dp[105][105];
void bfs ( )
{
    clr ( dp, 0 );
    priority_queue<node> pq;
    pq.push ( node ( 0, 0, adj[0][0] ) );
    dp[0][0] = adj[0][0];
    while ( ! pq.empty() ){
        node tmp = pq.top();
        pq.pop();
        if ( dp[tmp.x][tmp.y] > tmp.cnt ) continue;
        rep ( i, 0, 4 ){
            REP ( j, 1, k ){
                int xi = tmp.x + dir[i][0] * j;
                int yi = tmp.y + dir[i][1] * j;
                if ( xi < 0 || xi >= n || yi < 0 || yi >= n ) continue;
                if ( adj[xi][yi] > adj[tmp.x][tmp.y] && dp[xi][yi] < tmp.cnt + adj[xi][yi] ){
                    dp[xi][yi] = tmp.cnt + adj[xi][yi];
                    pq.push ( node ( xi, yi, tmp.cnt + adj[xi][yi] ) );
                }
            }
        }
    }
}
int main()
{
    while ( RDII ( n, k ) != EOF ){
        if ( k == -1 && n == -1 )break;
        rep ( i, 0, n ){
            rep ( j, 0, n ){
                RDI ( adj[i][j] );
            }
        }
        bfs ();
        int ans = 0;
        rep ( i, 0, n ){
            rep ( j, 0, n ){
                ans = max ( ans, dp[i][j] );
            }
        }
        PIL ( ans );
    }
    return 0;
}