Information
- ID
- 6761
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 306
- Accepted
- 111
- Uploaded By
#include <stdio.h>
int main() {
int n, max, num;
scanf("%d", &n);
max = num = 0;
for (int i = 0; i < n; i++)
{
scanf("%d", &num);
if (num > max)
{
max = num;
}
}
printf("%d", max);
return 0;
}
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.