Target DSA T4 | Problem - 1 Max Discount I

[@SupreetSingh946]

CPP Code
#include
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;

vector disc(n);

for(ll i=0; i> disc[i];
}

vector prefix_Or(n), suffix_Or(n);

// step1 : build prefox_or

for(ll i=1; i=0; i--) {
suffix_Or[i] = suffix_Or[i + 1] | disc[i + 1];
}

ll mx_disc = 0;

for(ll i=0; i