Write a C++ program, which finds the longest consecutive repeating number, and if there is a duplicate of the same amount it should return -1.

Ex1: [1, 0, 0, 0, 1 , 1] = 0

Ex2: [1, 1, 1, 0 , 0 ,0] = -1

Ex3: [1, 0, 1, 0, 1, 0, 1] = none

int main(){

int arr[] = {1, 0, 0, 0, 0, 1, 1};

...

}

int longestNumbers(int arr[], int n) {

...

}

}