-
Notifications
You must be signed in to change notification settings - Fork 0
/
BOJ1027.cpp
52 lines (51 loc) · 1.35 KB
/
BOJ1027.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
#include <iostream>
#include <queue>
#define MAX 51
using namespace std;
priority_queue <long long> q;
long long Building[MAX];
long long ableWatch(long long indx,long long numOfbuildings){//indx에서 볼수있는 빌딩의 수
long long sum=0;
long double NewTanjant;
long double OldTanjant;
OldTanjant=(long double)((long double)(Building[indx]-Building[indx-1])/(long double)(1));
for(long long i=indx-1;i>0;i--){
if(i==indx-1)
sum++;
else{
NewTanjant=(long double)((long double)(Building[indx]-Building[i])/(long double)(indx-i));
if(OldTanjant>NewTanjant){
OldTanjant=NewTanjant;
sum++;
}
}
}
OldTanjant=(long double)((long double)(Building[indx]-Building[indx+1])/(long double)(-1));
for(long long i=indx+1;i<=numOfbuildings;i++){
if(i==indx+1)
sum++;
else{
NewTanjant=(long double)((long double)(Building[indx]-Building[i])/(long double)(indx-i));
if(OldTanjant<NewTanjant){
OldTanjant=NewTanjant;
sum++;
}
}
}
return sum;
}
int main(void){
long long numOfbuildings,height,answer=0;
cin>>numOfbuildings;
for(long long i=1;i<=numOfbuildings;i++){
cin>>Building[i];
}
if(numOfbuildings==2){
cout<<1;
return 0;}
// cout<<ableWatch(1,numOfbuildings);
for(long long i=1;i<=numOfbuildings;i++)
q.push(ableWatch(i,numOfbuildings));
cout<<q.top();
return 0;
}