sicily 1157.The hardest problem

水- -但是WA了两次！原因是n signed 32-bit integers. 即你的max值初始不能为0.

#include <iostream>using namespace std;int main(){int n,max;while(cin >> n && n != 0){int data[5] = {0};cin >> max;for(int i = 0;i < n - 1;i++){cin >> data[i];if(data[i] > max)max = data[i];}cout << max << endl;}return 0;}