Subarray with distinct element sum

#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int* a=new int[n];
int j=0,sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
unordered_sets;
while(j<n && s.find(a[j])==s.end())
{
s.insert(a[j]);
j++;
}
sum+= ((j-i) * (j-i+1))/2;
s.erase(a[i]);
}
cout<<sum;

return 0;

}