尔滨之夏

摘要： #include<stdio.h>#include<string.h>#define max(a,b)((a)>(b))?(a):(b)int a[101][101],d[101][101];int n;int dp(int i,int j){ if(d[i][j]>=0)return d[i][j]; return d[i][j]=a[i][j]+(i==n-1?0:max(dp(i+1,j),dp(i+1,j+1)));}int main(){ int i,j; while(scanf("%d",&n)!=EOF) { for 阅读全文