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:T5af,#include using namespace std; int arr[100][100], dr[] = {1,-1,0,0}, dc[] = {0,0,1,-1}, R, C; int seen[100][100], cur; vector adj[10001]; bool seen2[10001]; void dfs(int r, int c) { seen[r][c] = cur; //printf("%d,%d is set to %d\n", r, c, cur); for(int t=0; t<4; t++) { int tr = r+dr[t], tc = c+dc[t]; if(0 <= tr && tr < R && 0 <= tc && tc < C && !seen[tr][tc] && arr[r][c] == arr[tr][tc]) { dfs(tr, tc); } } } int main() { cin >> R >> C; for(int i=0; i> arr[i][j]; } for(int i=0; i que; for(int i=1; i<=cur; i++) { memset(seen2, 0, sizeof seen2); int d = 0; que.push(i); seen2[i] = 1; while(1) { int s = que.size(); while(s--) { int f = que.front(); que.pop(); for(int a: adj[f]) { if(!seen2[a]) { seen2[a] = 1; que.push(a); } } } if(que.empty()) { break; } d++; } ans = min(ans, d); } //printf("longest dist is %d\n", ans); cout << ans; }5:["

코드 #3031