多线程dp求调,60pts

P1004 [NOIP2000 提高组] 方格取数

@[songzhihan2010](/user/910357) ```cpp #include<bits/stdc++.h> using namespace std; int n, i, j, l, k, x, y, s; int d[55][55],f[55][55][55][55]; int main() { cin>>n; while(cin>>x>>y>>s&&x) d[x][y]=s; for(i=1;i<=n;i++) for(j=1;j<=n;j++) for(l=1;l<=n;l++) for(k=1;k<=n;k++) { f[i][j][l][k]=max(max(f[i-1][j][l-1][k],f[i][j-1][l][k-1]),max(f[i-1][j][l][k-1],f[i][j-1][l-1][k]))+d[i][j]; if(i!=1&&j!=k) f[i][j][l][k]+=d[l][k]; } printf("%d",f[n][n][n][n]); return 0; } `````` 学废了吗?加一下,团队急需人才。https://www.luogu.com.cn/team/74508
by safdsfdeaf @ 2024-04-03 17:43:08


@[safdsfdeaf](/user/1089206) 谢谢,我回看看
by songzhihan2010 @ 2024-04-03 20:38:00


开longlong
by __ljy__ @ 2024-04-16 23:01:48


|