#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1000006;
int p[N];
int fi(int x)
{
if (x == p[x])
return x;
return p[x] = fi(p[x]);
}
void kpc(int x, int y)
{
x = fi(x);
y = fi(y);
p[x] = y;
}
int yans;
bool c[N];
int gw(int n, int* h)
{
vector<pair<int, int> > v;
for (int i = 0; i < n; ++i)
{
v.push_back(m_p(h[i], i));
}
sort(all(v));
reverse(all(v));
for (int i = 0; i < n; ++i)
{
p[i] = i;
}
int ans = 0;
for (int i = 0; i < n; ++i)
{
int x = v[i].se;
c[x] = true;
++yans;
if (i - 1 >= 0 && c[i - 1])
{
kpc(i, i - 1);
--yans;
}
if (i + 1 < n && c[i + 1])
{
kpc(i, i + 1);
--yans;
}
ans = max(ans, yans);
}
return ans;
}
/*int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
int n;
scanf("%d", &n);
int* h = new int[n + 5];
for (int i = 0; i < n; ++i)
scanf("%d", &h[i]);
printf("%d\n", gw(n, h));
return 0;
}*/
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
/usr/lib/gcc/x86_64-linux-gnu/7/../../../x86_64-linux-gnu/crt1.o: In function `_start':
(.text+0x20): undefined reference to `main'
collect2: error: ld returned 1 exit status
