免费馅饼（dp模版1的变体

题源#includebits/stdc.husingnamespacestd;constintN1e59;intarr[N][15];intdp[N][15];intmain(){intn,a,b;while(cinn,n!0){memset(arr,0,sizeof(arr));memset(dp,0,sizeof(dp));for(inti0;in;i){scanf(%d %d,a,b);arr[b][a];}for(inti1e5;i0;i--){for(intj0;j10;j){intmaxres0;if(j0){maxresmax(maxres,dp[i1][j-1]);}if(j10){maxresmax(maxres,dp[i1][j1]);}dp[i][j]arr[i][j]max(dp[i1][j],maxres);//coutdp[i][j]\n;}}coutdp[0][5];}return0;}