Gaming Array

                            Solution in C :

In C++ :





#include <bits/stdc++.h>

using namespace std;

int main()
{
    int Q;
    scanf("%d", &Q);
    while(Q--)
    {
        int N;
        scanf("%d", &N);
        int last=0, ans=0;
        for(int i=0; i<N; i++)
        {
            int x;
            scanf("%d", &x);
            if(x>last)
                last=x, ans^=1;
        }
        if(ans==0)
            printf("ANDY\n");
        else
            printf("BOB\n");
    }
    return 0;
}





In Java :





import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int g = sc.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = sc.nextInt();
            int[] a = new int[n];
            TreeMap<Integer, Integer> tm = new TreeMap<Integer, Integer>();
            for (int i = 0; i < n; i++) {
                a[i] = sc.nextInt();
                tm.put(a[i], i);
            }
            int lastIndex = n;
            int ans = 0;
            while (!tm.isEmpty()) {
                Map.Entry<Integer, Integer> e = tm.pollLastEntry();
                if (e.getValue() < lastIndex) {
                    lastIndex = e.getValue();
                    ans++;
                }
            }
            System.out.println(ans%2==0?"ANDY":"BOB");
        }
    }
}





In C :





#include<stdio.h>
typedef unsigned u;
int main()
{
	u t,n,p,a,r;
	for(scanf("%u",&t);t--;printf(r?"BOB\n":"ANDY\n"))
	for(scanf("%u",&n),p=r=0;n--;)
	{
		scanf("%u",&a);
		if(a>p){p=a;r^=1;}
	}
	return 0;
}





In Python3 :





#!/bin/python3

import sys

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    a = list(map(int, input().split()))
    maxtotheleft = []
    curmaxidx = None
    for i in range(n):
        if curmaxidx == None or a[curmaxidx] < a[i]:
            curmaxidx = i
        maxtotheleft.append(curmaxidx)
        
    curplayer = True
    for i in reversed(range(n)):
        if maxtotheleft[i] == i:
            curplayer = not curplayer
            
    if curplayer:
        print("ANDY")
    else:
        print("BOB")