lkyLKY(祝忘羡99版) • 7天前
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int max = 0, r = n - 1, l = 0;
while (l < r) {
int H = h[l] > h[r] ? h[r] : h[l];
int W = r - l;
int s = H * W;
if (s > max) {
max = s;
}
if (h[l] < h[r]) {
l++;
} else {
r--;
}
}
cout << max;
return 0;
}
评论:
请先登录,才能进行评论