The 5th Zhejiang Provincial Collegiate Programming Contest
Faster, Higher, Stronger
求数列最大/小值!?
#include<iostream>
using namespace std;
int main()
{
int t,n,sum,flag;
cin>>t;
string c;
while(t--)
{
cin>>c;
if(c[0]=='F')
{
cin>>n;
flag=1111110;
for(int i=0;i<n;i++)
{
cin>>sum;
if(flag>=sum)
flag=sum;
}
cout<<flag<<endl;
}
else
{
cin>>n;
flag=0;
for(int i=0;i<n;i++)
{
cin>>sum;
if(flag<sum)
flag=sum;
}
cout<<flag<<endl;
}
}
return 0;
}
PS:只看sample输入输出就能明白