1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; long long n,a[1000005],ans; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1,j=n;i<j;) { ans=max(ans,min(a[i],a[j])*(j-i)); if(a[i]>a[j])j--; else if(a[i]<a[j])i++; else i++,j--; }cout<<ans; return 0; }
- 1
Information
- ID
- 760
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 2
- Accepted
- 2
- Uploaded By