제출 #1190868

#제출 시각아이디문제언어결과실행 시간메모리
1190868vusalMountains (NOI20_mountains)C++20
13 / 100
111 ms7496 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int oo = 1e18; const int MAXN = 1e5 + 7; const int MAXH = 1e2 + 4; void _() { int n; cin >> n; vector<int>v(n); for(int &i : v) cin >> i; vector<int>left(n), right(n); vector<int>freq(MAXH, 0); for(int i = 0; i < n; i++) { int h = v[i]; int cnt = 0; for(int j = 0; j < h; j++) cnt += freq[j]; left[i] = cnt; freq[h]++; } for(int i = 0; i < MAXH; i++) freq[i] = 0; for(int i = n - 1; i >= 0; i--) { int h = v[i]; int cnt = 0; for(int j = 0; j < h; j++) cnt += freq[j]; right[i] = cnt; freq[h]++; } int sum = 0; for(int i = 0; i < n; i++) { sum += (1LL * left[i] * right[i]); } cout << sum << endl; } signed main() { int tt = 1; // cin >> tt; while(tt--) _(); }
#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...