Submission #570157

#TimeUsernameProblemLanguageResultExecution timeMemory
570157XJP12Mountains (NOI20_mountains)C++14
0 / 100
2095 ms1364 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int ll; int main(){ int n; cin>>n; vector<int> v(n); for(int i=0; i<n; i++){ cin>>v[i]; } int cont=1; ll ans=0; int a,b; while(cont<n-1){ a=0; b=0; for(int i=0; i<cont; i++){ if(v[i]<v[cont]) a++; } for(int i=cont+1; i<n; i++){ if(v[i]<v[cont]) b++; } ans+=a*b; cont++; } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...