2 條題解
-
1
#include<iostream> using namespace std; #define ll long long ll a[5005]; int main() { int t; cin>>t; while (t--) { int n; cin>>n; ll ans = 0; for (int i =1;i<=n;i++) { cin>>a[i]; } for ( int i =2;i<=n-1;i++) { ll s1 = 0,s2 = 0; for ( int j = 1;j<i;j++) { int len = i-j; ll qwq = min(a[i],a[j]); ll re = lenqwq; s1 = max(s1,re); } for ( int j =i+1;j<=n;j++) { int len = j-i; ll qwq = min(a[j],a[i]); ll re =lenqwq; s2 = max(s2,re); } ans = max(ans,s1+s2); } cout<<ans<<endl; } return 0;
}
資訊
- ID
- 1200
- 時間
- 1000ms
- 記憶體
- 256MiB
- 難度
- 8
- 标签
- (無)
- 遞交數
- 183
- 已通過
- 31
- 上傳者