怎么把这个代码改写成c++

Const
dx:array[1..8] of longint=(2 , 2 ,1 ,1 ,-1, -1,-2,-2);
dy:array[1..8] of longint=(1 ,-1 ,2,-2 ,2 ,-2 ,1,-1);
VAR
opt,map:array[0..470,0..470] of longint;
next:array[0..470,0..470] of record x,y:longint; end;
i,j,n,temp,max,ans,stx,sty:longint;

Procedure init;
Begin
fillchar(map,sizeof(map),255);
fillchar(opt,sizeof(opt),255);
fillchar(next,sizeof(next),0);
readln(n);
for i:=1 to n do begin
for j:=1 to n do
read(map[i,j]);
readln;
end;
End;

Function mfs(x,y:longint):longint;
Var
i,nx,ny,temp,now,max:longint;
Begin
max:=maxlongint;
now:=0;
if opt[x,y]<>-1 then exit(opt[x,y]);
for i:=1 to 8 do begin
nx:=x+dx[i];
ny:=y+dy[i];
if (nxn) or (nyn) or (map[x,y]>=map[nx,ny]) then continue;
temp:=mfs(nx,ny);
if (temp>now) or ((temp=now) and (map[nx,ny]<max)) then begin
max:=map[nx,ny];
next[x,y].x:=nx;
next[x,y].y:=ny;
now:=temp;
end;
end;
inc(now);
opt[x,y]:=now;
exit(now);
End;

Procedure print(x,y:longint);
Begin
writeln(map[x,y]);
if next[x,y].x<>0 then print(next[x,y].x,next[x,y].y);
End;

BEGIN
init;
max:=maxlongint;
for i:=1 to n do
for j:=1 to n do begin
temp:=mfs(i,j);
if (ans<temp) or ((ans=temp) and (map[i,j]<max)) then begin
max:=map[i,j];
stx:=i;
sty:=j;
ans:=temp;
end;
end;
writeln(ans);
print(stx,sty);
END.

 #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
const int N= 366;
const int INF = 0x3f3f3f3f;
int dp[N][N],pre[N][N];
int ini[N][N];
int n;
struct nod{
    int x,y,d;
    bool operator<(const nod t)const{
        return d>t.d;
    }
} re[N*N];
bool oor(int &x,int &y){
    if(x<0||x>=n) return false;
    if(y<0||y>=n) return false;
    return true;
}
int dx[]={-2,-2,-1,1,2,2,1,-1};
int dy[]={-1,1,2,2,1,-1,-2,-2};
int main()
{
    freopen("in.txt","r",stdin);
    while(~scanf("%d",&n))
    {
        int cnt = 0;
        for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
            scanf("%d",&ini[i][j]);
            re[cnt].d = ini[i][j];
            re[cnt].x = i,re[cnt].y = j;
            cnt++;
        }
        sort(re,re+cnt);
        memset(dp,0,sizeof(dp));
        int i,j,tx,ty,x,y;
        int ff = INF,an = -1,rx,ry;
        for(i=0;i<cnt;i++)
        {
            x = re[i].x,y=re[i].y;
            int t = 0,ma=-1,f=INF;
            for(j=0;j<8;j++)
            {
                tx = x+dx[j],ty = y+dy[j];
                if(!oor(tx,ty)) continue;
                if(t<dp[tx][ty]||(t==dp[tx][ty]&&f>ini[tx][ty]))
                t = dp[tx][ty],ma = j,f = ini[tx][ty];
            }
            dp[x][y] = ++t;
            pre[x][y] = ma;
            if(dp[x][y]>an||(dp[x][y]==an&&ini[x][y]<ff))
            an = dp[x][y], ff = ini[x][y],rx = x,ry = y;
        }
        printf("%d\n",dp[rx][ry]);
        tx = rx,ty = ry;
        for(int i=0;i<dp[rx][ry];i++)
        {
            printf("%d\n",ini[tx][ty]);
            int k = pre[tx][ty];
            tx += dx[k];
            ty += dy[k];
        }
    }
    return 0;
}