Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- _____ _ _ _ _
- |_ _| |__ ___ / \ _ __ ___| |__ _ _| |
- | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
- | | | | | | __// ___ \| | | \__ \ | | | |_| | |
- |_| |_| |_|\___/_/ \_\_| |_|___/_| |_|\__,_|_|
- */
- #include<bits/stdc++.h>
- #define ll long long
- #define rep(i,a,b) for(ll int i=a;i<b;i++)
- #define vi vector<ll int>
- #define F first
- #define S second
- #define lbnd lower_bound
- using namespace std;
- #define N 100005
- void solve()
- {
- ll n;
- cin>>n;
- vi v(n);
- map<ll,ll>mp,fr;
- vi ans(n,0);
- ll sum=0;
- rep(i,0,n)
- cin>>v[i];
- for(ll i=n-1;i>=0;i--)
- {
- auto it = mp.lbnd(-v[i]);
- if(it==mp.end())
- ans[i]=0;
- else
- {
- ans[i]=ans[it->S]+1;
- sum+=ans[i];
- }
- fr[v[i]]++;
- mp[-v[i]]=i;
- }
- for(auto i:fr)
- sum-=(i.S*(i.S-1))/2;
- cout<<sum;
- return;
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- cout.tie(0);
- int TESTS=1;
- // cin>>TESTS;
- while(TESTS--)
- {
- solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment