首页 > ACM题库 > HDU-杭电 > hdu 2071 Max Num[解题报告]C++
2013
12-29

hdu 2071 Max Num[解题报告]C++

Max Num

问题描述 :

There are some students in a class, Can you help teacher find the highest student .

输入:

There are some cases. The first line contains an integer t, indicate the cases; Each case have an integer n ( 1 ≤ n ≤ 100 ) , followed n students’ height.

输出:

There are some cases. The first line contains an integer t, indicate the cases; Each case have an integer n ( 1 ≤ n ≤ 100 ) , followed n students’ height.

样例输入:

2
3 170.00 165.00 180.00
4 165.00 182.00 172.00 160.00

样例输出:

180.00
182.00

原题点击打开链接

#include<stdio.h>
int main(void){
int n,t,i;
double high[101],maxn;
scanf("%d",&n);
while(n--){
        maxn=0;
    scanf("%d",&t);
    for(i=0;i<t;i++){
            scanf("%lf",&high[i]);
    if(maxn<high[i])maxn=high[i];
    }
    printf("%.2f\n",maxn);
}
return 0;
}

解题转自:http://blog.csdn.net/budatuacm/article/details/9396353