#1428. 屌丝VS女神前传
屌丝VS女神前传
<strong>题目描述</strong>
<p class="p0" style="text-align:justify;"> <span style="font-size:14pt;font-family:'宋体';">女神如此多娇,引无数屌丝尽折腰!数院新生中最耀眼的女神,偏偏不喜欢数学比她差的男生,无数的屌丝追求者都被她的难题给击退了,信院屌丝阿<span>V</span><span>自从在学三见到女神的第一眼便深陷其中不可自拔。没有例外,冷酷的女神对阿</span><span>V</span><span>提出了她的难题:给你</span><span>n</span><span>个数,你能在一天之内找出里面最大的数么?一大堆的数字看得阿</span><span>V</span><span>眼花缭乱,请你帮忙设计一个程序,找出这</span><span>n</span><span>个数中的最大值。</span></span><span style="font-size:14pt;font-family:'宋体';"></span> </p>
<strong>输入格式</strong>
<p class="p0" style="text-align:justify;"> <span style="font-size:14pt;font-family:'宋体';">首先输入一个整数<span>n</span><span>(</span><span>1<=n<=10^6</span><span>),表示有</span><span>n</span><span>个数,每个数不大于</span><span>10^11</span><span>,下一行输入</span><span>n</span><span>个整数。以</span><span>EOF</span><span>结束。</span></span><span style="font-size:14pt;font-family:'宋体';"></span> </p>
<strong>输出格式</strong>
<p class="p0" style="text-align:justify;"> <span style="font-size:14pt;font-family:'宋体';">输出这<span>n</span><span>个数中最大的值,每个输出占一行。</span></span><span style="font-size:14pt;font-family:'宋体';"></span> </p>
<strong>样例</strong>
<strong>样例 1</strong>
输入 # 1
3
6 8 5
8
5 6 7 3 100000000 6 9 2
输出 # 1
8
100000000
<strong>来源</strong>
屌丝VS女神 前传