L. Nise-Anti-AK Problem //找最大元素

Description:

Peppa has been learning math recently, he is trapped by a easy problem. He is given a sequence of n numbers, what he need to do is finding the number ai which have the largest number f(ai). The function f(x)=∑(i|x) where i goes form 0 to x, | is the symbol of or-by-bit calculate.

Input:

The first line of the input has an integer T(1<=T<=10), which represents the number of test cases.

In each test case, the first line of the input contains an integers n(1<=n<=1000)--the number of the integers, next line has n integers a[i] (1 <= a[i] <= 10000).

Output:

Each test case output an integer ai which have the largest number f(ai). 

忽略每行输出的末尾多余空格

样例输入

1
3
2 3 5

样例输出

5

题目来源

思路：找最大的元素。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int t;
	int n,i,j,a;
	int maxn;
	scanf("%d",&t);
	while(t--)
	{
		 maxn=0;
		scanf("%d",&n);
		 for(i=0;i<n;i++)
		 {
		 	scanf("%d",&a);
		 	  maxn=max(maxn,a);
		 }
		 printf("%d\n",maxn);
	}
	return 0;
}