#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr(x, l, r) for(int x = l; x <= r; x++)
#define rf(x, l, r) for(int x = l; x >= r; x--)
#define fe(x, y) for(auto& x : y)
#define fi first
#define se second
#define m_p make_pair
#define pb push_back
#define pw(x) (ull(1) << ull(x))
#define all(x) (x).begin(),x.end()
#define sz(x) (int)x.size()
#define mt make_tuple
#define ve vector
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <ld,ld> pld;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key
template<typename T>
bool umn(T& a, T b) { return a > b ? a = b, 1 : 0; }
template<typename T>
bool umx(T& a, T b) { return a < b ? a = b, 1 : 0; }
const ll inf = 1e18;
const int intf = 1e9;
const ll mod = 1e9 + 7;
const ld eps = 0.00000001;
const ll N = 1e5 + 5;
ll a[N], b[N], B, f[N], n;
queue <ll> q;
void add(int pos, int& ans){
if(pos < 0 || pos >= n || f[pos] || a[pos] > B)return;
ans++;
f[pos] = 1;
q.push(pos);
}
int main(){
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt","w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
#else
// freopen("mountains.in", "r", stdin);
// freopen("mountains.out","w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
cin >> n;
fr(i, 0, n - 1){
cin >> a[i];
}
bool f = 0;
fr(i, 0, n - 1){
cin >> b[i];
if(i && b[i] != b[i - 1]){
f = 1;
}
}
if(!f){
int ans = 0;
B = b[0];
fr(i, 0, n - 1){
if(a[i] == B){
q.push(i);
f[i] = 1;
ans++;
}
}
while(!q.empty()){
int p = q.front();
add(p + 1, ans);
add(p - 1, ans);
q.pop();
}
cout << ans << endl;
}
else{
}
return 0;
}
Compilation message
exam.cpp: In function 'int main()':
exam.cpp:87:18: error: invalid types 'bool[int]' for array subscript
87 | f[i] = 1;
| ^
