题目链接:Problem - 6318
其实就是求逆序数,再乘以min(x,y)。
一开始用cin输入就超时了……
AC代码:
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<map>
using namespace std;
const int N=100005;
int a[N],c[N];
long long cnt;
void Merge(int a[],int le,int mid,int rh);
void MergeSort(int a[],int le,int rh)
{
if(rh>le)
{
int mid=(le+rh)/2;
MergeSort(a,le,mid);
MergeSort(a,mid+1,rh);
Merge(a,le,mid,rh);
}
}
void Merge(int a[],int le,int mid,int rh)
{
int i=le,j=mid+1,tmp=1;
while(i<=mid&&j<=rh)
{
if(a[j]<a[i])
{
c[tmp++]=a[j++];
cnt+=mid-i+1;
}
else
{
c[tmp++]=a[i++];
}
}
if(j<=rh)
{
for(;j<=rh;++j)
{
c[tmp++]=a[j];
}
}
else
{
for(;i<=mid;++i)
{
c[tmp++]=a[i];
}
}
for(i=le;i<=rh;++i)
{
a[i]=c[i-le+1];
}
}
int main()
{
int n,x,y;
while(scanf("%d %d %d",&n,&x,&y)!=EOF)
{
memset(a,0,sizeof(a));
memset(c,0,sizeof(c));
cnt=0;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
MergeSort(a,0,n-1);
cnt*=min(x,y);
printf("%lld\n",cnt);
}
}
另外队友用树状数组写了一个,不过可能会出现相同的数,离散化的时候要注意。
AC代码:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
const int MAXN=1E5+100;
int C[MAXN],arr[MAXN],link[MAXN],id[MAXN];
int cmp(int a,int b)
{
return arr[a]<arr[b];
}
int lowbit(int x)
{
return x&(-x);
}
void update(int p)
{
for (int i=p;i<MAXN;i+=lowbit(i))
{
C[i]++;
}
}
int sum(int p)
{
int res=0;
for (int i=p;i>0;i-=lowbit(i))
{
res+=C[i];
}
return res;
}
int main()
{
int n,x,y;
while (scanf("%d",&n)!=EOF)
{
scanf("%d %d",&x,&y);
memset(C,0,sizeof(C));
for (int i=1;i<=n;i++)
{
scanf("%d",&arr[i]);
link[i]=i;
}
sort(link+1,link+1+n,cmp);
int l=1;
//for (int i=1;i<=n;i++) printf("%d ",rem[i]);printf("\n");
for(int i=1;i<=n;i++)
{
if (i>1 && arr[link[i-1]]==arr[link[i]]) id[link[i]]=id[link[i-1]];
else id[link[i]]=l++;
}
//for (int i=1;i<=n;i++) printf("%d ",id[i]);printf("\n");
long long ans=0;
for (int i=1;i<=n;i++)
{
ans+=sum(MAXN-1)-sum(id[i]);
//printf("arr=%d %d\n",arr[i],ans);
update(id[i]);
}
printf("%lld\n",ans*min(x,y));
}
return 0;
}