-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathLargest Plus Sign.cpp
53 lines (53 loc) · 1.39 KB
/
Largest Plus Sign.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
class Solution {
public:
int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {
//jai shri ram
int ans=0;
vector<bool>block(25*int(1e4)+1,0);
vector<vector<int>>dp(n,vector<int>(n,0));
for(auto x:mines){
int a=x[0],b=x[1];
block[a*n+b]=true;
}
for(int i=0;i<n;i++){
int sum=0;
for(int j=0;j<n;j++){
if(block[i*n+j]){
sum=0;
}else {
sum+=1;
}
dp[i][j]=sum;
}
}
for(int j=0;j<n;j++){
int sum=0;
for(int i=0;i<n;i++){
if(block[i*n+j]){
sum=0;
}else sum+=1;
dp[i][j]=min(dp[i][j],sum);
}
}
for(int j=n-1;j>=0;j--){
int sum=0;
for(int i=n-1;i>=0;i--){
if(block[i*n+j]){
sum=0;
}else sum+=1;
dp[i][j]=min(dp[i][j],sum);
}
}
for(int i=n-1;i>=0;i--){
int sum=0;
for(int j=n-1;j>=0;j--){
if(block[i*n+j]){
sum=0;
}else sum+=1;
dp[i][j]=min(dp[i][j],sum);
ans=max(ans,dp[i][j]);
}
}
return ans;
}
};