1 solutions
-
0
C++ :
#include<iostream> #include<algorithm> using namespace std; int n,a[10008],mx,mxx,l,s; int main() { cin>>n; for (int i=1;i<=n;i++){ cin>>a[i]; if (a[i]>mx) {mx=a[i];l=i;} } for (int i=1;i<=n;i++) if (a[i]<mx&&a[i]>mxx) {mxx=a[i];s=i;} cout<<abs(l-s)*10<<endl; return 0; }
- 1
Information
- ID
- 863
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 3
- Accepted
- 3
- Uploaded By