#include <iostream>
#include <vector>
#include <algorithm>
int solution(int n, std::vector<int> a) {
// PLEASE DO NOT MODIFY THE FUNCTION SIGNATURE
// write code here
int ans = 0;
for(int i = 0; i < a.size() - 1; i++){
for(int j = i + 1; j < a.size(); j++){
int temp = std::min(j - i, (int)(a.size() - (j - i))) * (a[i] + a[j]);
ans =std::max(ans, temp);
}
}
return ans; // Placeholder return
}
int main() {
std::cout << (solution(3, {1, 2, 3}) == 5) << std::endl;
std::cout << (solution(4, {4, 1, 2, 3}) == 12) << std::endl;
std::cout << (solution(5, {1, 5, 3, 7, 2}) == 24) << std::endl;
return 0;
}
21.环形数组中的最大贡献值
最新推荐文章于 2025-04-28 07:10:09 发布