牛牛爱位运算
题目链接:https://ac.nowcoder.com/acm/problem/205085
1 #include<bits/stdc++.h> 2 using namespace std; 3 int t; 4 int n, a; 5 int ans; 6 int main() 7 { 8 cin>>t; 9 while(t--) 10 { 11 cin>>n; 12 for(int i=1; i<=n; i++) 13 { 14 cin>>a; 15 if(i==1)ans=a; 16 if(a >= ans)ans=a; 17 } 18 cout<<ans<<endl; 19 } 20 return 0; 21 }