关于dp方案记录的方法思考与优化

void print(int x,int y)
{
    if(pre[x][y]==y)
    {
        cout<<y<<" ";
        return;
    }

    print(x-1,pre[x][y]);
    cout<<y<<" ";//记得输出是逆序的
}

int x = F;
std::vector<int> v;
for(; x >= 1; y = pre[x][y], x--)
    v.push_back(y);

reverse(v.begin(), v.end());
cout<<ans<<endl;
for(int i = 0; i < (int) v.size(); i++)
    cout<<v[i]<<" ";
puts("");