编程介的小学生 2018-11-21 13:37 采纳率: 20.5%
浏览 371
已采纳

这个题目中的整数MAX怎么求解 ?

Problem Description
Giving N integers, V1, V2,,,,Vn, you should find the biggest value of F.

Input
Each test case contains a single integer N (1<=N<=100). The next line contains N integers, meaning the value of V1, V2....Vn.(1<= Vi <=10^8).The input is terminated by a set starting with N = 0. This set should not be processed.

Output
For each test case, output the biggest value of F you can find on a line.

Sample Input
2
1 2
0

  • 写回答

1条回答 默认 最新

  • threenewbee 2019-01-10 00:15
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 怎么获取下面的: glove_word2id.json和 glove_numpy.npy 这两个文件
  • ¥15 js调用html页面需要隐藏某个按钮
  • ¥15 ads仿真结果在圆图上是怎么读数的
  • ¥20 Cotex M3的调试和程序执行方式是什么样的?
  • ¥20 java项目连接sqlserver时报ssl相关错误
  • ¥15 一道python难题3
  • ¥15 牛顿斯科特系数表表示
  • ¥15 arduino 步进电机
  • ¥20 程序进入HardFault_Handler
  • ¥15 oracle集群安装出bug