Dp,不想写左偏树的我还是乖乖做点水题吧 ……
状态定义(十分显然):
从三个方向推过来,能够被更新 Dp 值的也将路径一起更新 。
然后我的代码需要注意的是:
A(i,j)表示的是第 i 行第 j 列方格的值 。
然而
Dp(i,j)表示的是第 i 列第 j 行到终点的最小值 。
然而
Tag(i,j)表示的是走到第 i 行第 j 列下一步走的点的行号 。
比较绕 ……
代码:
#include <bits/stdc++.h>
#pragma GCC optimize(2)
const int N = 1000 + 5 ;
int a [ N ] [ N ] , n , m , inf ;
int dp [ N ] [ N ] , tag [ N ] [ N ] ;
void init ( ) {
memset ( tag , 0 , sizeof ( tag ) ) ;
memset ( a , 0 , sizeof ( a ) ) ;
}
int main ( ) {
while ( scanf ( "%d%d" , & n , & m ) == 2 ) {
init ( ) ;
for ( int i = 1 ; i <= n ; i ++ )
for ( int j = 1 ; j <= m ; j ++ )
scanf ( "%d" , & a [ i ] [ j ] ) ;
memset ( dp , 127 / 3 , sizeof ( dp ) ) ;
inf = dp [ 0 ] [ 0 ] ;
for ( int i = 1 ; i <= n ; i ++ )
dp [ m ] [ i ] = a [ i ] [ m ] ;
for ( int i = m ; i >= 1 ; i -- )
for ( int j = 1 ; j <= n ; j ++ ) {
int mv [ 5 ] ;
mv [ 1 ] = j + 1 , mv [ 2 ] = j , mv [ 3 ] = j - 1 ;
if ( mv [ 1 ] > n ) mv [ 1 ] = 1 ;
if ( mv [ 3 ] < 1 ) mv [ 3 ] = n ;
for ( int k = 1 ; k <= 3 ; k ++ )
if ( dp [ i - 1 ] [ mv [ k ] ] > dp [ i ] [ j ] + a [ mv [ k ] ] [ i - 1 ] ) {
tag [ mv [ k ] ] [ i - 1 ] = j ;
dp [ i - 1 ] [ mv [ k ] ] = dp [ i ] [ j ] + a [ mv [ k ] ] [ i - 1 ] ;
}
}
int ans = inf , plc = 1 ;
for ( int i = 1 ; i <= n ; i ++ )
if ( dp [ 1 ] [ i ] < ans )
plc = i , ans = dp [ 1 ] [ i ] ;
printf ( "%d" , plc ) ;
for ( int i = 1 ; i < m ; i ++ ) {
plc = tag [ plc ] [ i ] ;
printf ( " %d" , plc ) ;
}
printf ( "\n%d\n" , ans ) ;
}
return 0 ;
}