1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T4b5,#include using namespace std; /* dp[k][i][j]: i,j at middle, width 2k+1: max (find k+1 size) */ int arr[2][1000][1000], ans[1000][1000]; int main() { ios::sync_with_stdio(0);cin.tie(0); int n; cin >> n; for(int i=0; i> arr[0][i][j]; ans[i][j] = arr[0][i][j] - 1; } } for(int i=0; i=0) arr[c][i][j] = max(arr[c][i][j], arr[p][i+1][j-1]); if(i-1>=0 && j+1=0 && j-1>=0) arr[c][i][j] = max(arr[c][i][j], arr[p][i-1][j-1]); ans[i][j] = max(ans[i][j], arr[c][i][j] - (k+1)*(k+1)); } } } for(int i=0; i

코드 #4418