//#include <iostream> //cin, cout
#include "secret.h"
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
//usings
using namespace std;
using namespace __gnu_pbds;
// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// maps
#define mii map<int, int>
#define mll map<ll, ll>
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)
int n;
vvi v = vvi(1005, vi(1005, 0));
void go(int l, int r, int a[]){
if(l == r) {
v[l][r] = a[l];
return;
}
int m = (l + r) / 2;
v[m][m] = a[m];
for(int i = m - 1; i >= l; i--) v[l][i] = Secret(v[l][i + 1], a[i]);
v[m + 1][m + 1] = a[m + 1];
for(int i = m + 2; i <= r; i++) v[i][r] = Secret(v[i - 1][r], a[i]);
go(l, m, a);
go(m + 1, r, a);
}
void Init(int N, int A[]){
n = N;
go(0, n - 1, A);
}
int Query(int L, int R){
int l = 0, r = n - 1;
while(l != r){
int m = (l + r) / 2;
else if(L <= m && R > m) return Secret(v[L][m], v[m][R]);
else if(R == m) return v[L][m];
else if(m < L) L = m + 1;
else R = m;
}
return v[l][l];
}
Compilation message
secret.cpp: In function 'int Query(int, int)':
secret.cpp:116:3: error: 'else' without a previous 'if'
116 | else if(L <= m && R > m) return Secret(v[L][m], v[m][R]);
| ^~~~
