1R/2016 09 27 - Revision history

Maintenance script: Repair pages found by live-compare batch 0001

2026-03-26T14:46:15Z

Repair pages found by live-compare batch 0001

165.194.27.163 at 12:55, 30 September 2016

2016-09-30T12:55:14Z

@@ Line 60: / Line 60: @@
+  }
 == 박인서 ==
 == 곽정흠 ==
@@ Line 67: / Line 110: @@
 * 걍 dfs했습니다.
 * 약간의 dp를 첨가했습니다.
 == 박인서 ==
 == 곽정흠 ==

165.194.27.163: {CREATE}

2016-09-28T05:27:21Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/1937|욕심쟁이 판다]

= 참가자 =
* 15이원준
= 코드 =
== 15이원준 ==
#include<iostream>

using namespace std;

int arr[502][502] = { 0, };
int dp[502][502] = { 0, };
int ans = 0;
int N;
int search(int x, int y){
if(dp[x][y] || x <= 0|| y <= 0 || x > N || y > N){
return dp[x][y];
}
int now = 0;

if(arr[x][y] < arr[x+1][y]){
dp[x][y] = max(search(x + 1, y) + 1 ,dp[x][y]);
}
if(arr[x][y] < arr[x-1][y]){
dp[x][y] = max(search(x - 1, y) + 1 ,dp[x][y]);
}
if(arr[x][y] < arr[x][y+1]){
dp[x][y] = max(search(x, y + 1) + 1 ,dp[x][y]);
}
if(arr[x][y] < arr[x][y-1]){
dp[x][y] = max(search(x, y - 1) + 1 ,dp[x][y]);
}
if(dp[x][y] > ans){
ans = dp[x][y];
}
return dp[x][y];
}
int main(){
cin>> N;
for(int i = 1; i<=N; i++){
for(int j = 1; j <= N; j++){
int tmp;
scanf("%d", &tmp);
arr[i][j] = tmp;
}
}
for(int i = 1; i<=N; i++){
for(int j = 1; j <= N; j++){
if(!dp[i][j]){
search(i,j);
}
//cout<< dp[i][j] << " ";
}
//cout<<endl;
}
cout<< ans + 1 <<endl;
}
== 박인서 ==

== 곽정흠 ==

= 아이디어 =
== 15이원준 ==
* 걍 dfs했습니다.
* 약간의 dp를 첨가했습니다.
== 박인서 ==

== 곽정흠 ==