프로그래밍/알고리즘 문제풀이
[백준] [c++] 1027번 고층 건물
엽기토기
2021. 7. 10. 13:40
반응형

//
// main.cpp
// acm
//
// Created by Nathan on 2020/09/21.
//
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char * argv[]) {
vector<int> vec;
int n;
cin>>n;
vector<int> num;
for(int i = 0; i < n; i++)
{
int t;
cin>>t;
vec.push_back(t);
num.push_back(0);
}
for(int i = 0; i < n; i++)
{
long double comp = -9999999999.0;
for (int j = i + 1; j < n; j++)
{
long double t = (double)((double)(vec[j] - vec[i]))/(double)(j-i);
if (t > comp)
{
comp = t;
num[i]++;
num[j]++;
}
}
}
int result = -1;
for(int i=0;i<n;i++){
if(num[i]>result){
result=num[i];
}
}
cout<<result;
}반응형