Function to find the length of the longest subsequence such that the XOR of adjacent elements in the subsequence must be non - decreasing
int LongestXorSubsequence ( int arr [ ] , int n ) { vector < pair < int , pair < int , int > > > v ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) {