京东烽火台
#include<iostream>
#include<vector>
using namespace std;
bool isok(int i, int j, vector<int>&h)
{
int ci = i+1;
while (h[ci] <= h[i] && h[ci] <=
h[j]&&ci<j)
{
ci++;
}
if (ci == j)
return true;
int cj = j+1;
bool fa = true;
if (cj == h.size())
{
cj = 0;
fa = false;
}
while (h[cj] <= h[i] && h[cj] <=
h[j]&&((!fa&&cj<i)||fa))
{
cj++;
if (cj == h.size())
{
cj = 0;
fa = false;
}
}
if (cj == i)
return true;
return false;
}
int main()
{
int n;
while (cin >> n)
{
vector<int>hill(n);
for (int i = 0; i<n; i++)
{
cin >> hill[i];
}
int cnt = n;
vector<vector<int>> p(n, vector<int>(n,
0));
for (int i = 0; i<n; i++)
{
for (int j = i; j<n; j++)
{
if (p[i][j] == 0)
{
p[i][j] = 1;
p[j][i] = 1;
}
else if (p[i][j] == 1)
continue;
if (i == j||abs(i-j)==1||(i==0&&j==n-1))
continue;
if (isok(i, j, hill))
{
cout << i << j << endl;
cnt++;
}
}
}
cout << cnt << endl;
}
}
腾讯一面2164人在聊
