一.数字三角形
1.摘花生:
#include <bits/stdc++.h> using namespace std; const int N = 110; int a[N][N];int f[N][N]; int main() { int t; cin>>t; while(t--) { memset(f,0,sizeof(f)); int r,c; cin>>r>>c; for(int i=1;i<=r;i++){ for(int j=1;j<=c;j++) cin>>a[i][j]; } for(int i=1;i<=r;i++){ for(int j=1;j<=c;j++){ f[i][j]=max(f[i-1][j],f[i][j-1])+a[i][j]; } } cout<<f[r][c]<<endl; } return 0; }
2.最低通行费
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int a[N][N];int f[N][N];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
cin>>a[i][j];
}
memset(f,0x3f,sizeof(f)); //注意处理边界情况,当i=1||j=1时,f[0][j]||f[i][0]
//为0,出现误判
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==1&&j==1) f[i][j]=a[i][j];
else f[i][j]=min(f[i-1][j],f[i][j-1])+a[i][j];
}
}
cout<<f[n][n]<<endl;
return 0;
}
3.方格取数
#include <bits/stdc++.h>
using namespace std;
const int N = 15;
int w[N][N],f[2*N][N][N];
int main()
{
int n,a,b,c;
cin>>n;
while(cin>>a>>b>>c,a||b||c) w[a][b]=c;
for(int k=2;k<=2*n;k++)
for(int i1=1;i1<=n;i1++)
for(int i2=1;i2<=n;i2++)
{
int j1=k-i1,j2=k-i2;
int t=w[i1][j1];
if(i1!=i2) t+=w[i2][j2];
if(j1>=1&&j1<=n&&j2>=1&&j2<=n){
int &x=f[k][i1][i2];
x=max(x,f[k-1][i1-1][i2-1]+t);
x=max(x,f[k-1][i1][i2-1]+t);
x=max(x,f[k-1][i1-1][i2]+t);
x=max(x,f[k-1][i1][i2]+t);
}
}
cout<<f[2*n][n][n];
return 0;
}