生椰拿铁 · 发布于 2026-02-03 · 浏览 219 回复 0

int n, max = -999999;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
for (int x = 0; x < n; x++) {
	if (a[x] > max) {
		max = a[x];
	}
}
cout << max;
return 0;