Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu

Hybrid maximum solution /*---------JAI HO GURUDEV---------*/  #include<bits/stdc++.h> using namespace std; #define ll long long  #define int long long #define f(i,n) for(ll i=0;i<n;i++) #define fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0); #define f1(i,n) for(ll i=n;i>=0;i--) #define fo(i,a,b) for(ll i=a;i<=b;i++) #define forr1(i,a,b) for(ll i=a;i>=a;i--) #define rep(i,a,b)  for(int i=a;i<b;i++) #define sor(vec) sort(vec.begin(),vec.end()) #define asor(ar) sort(ar,ar+ar.size()); #define rsor(vec) sort(vec.rbegin(),vec.rend()); #define dbg(var) cout<<#var<<"="<<var<<" " #define vl vector<ll> #define yes cout << "YES"<< endl; #define no cout << "NO"<< endl; #define out(n) cout << n << endl; #define ...