总结:
1.题意没有好好分析,1<i,j,k<=N A<B<C,说明可以不用在意i,j,k的大小,进行二分,桶排序。A<B<C说明A=B=C的时候是不成立的
2.数据范围可能过大,需要开longlong保存,(遇到多个两个数相乘就要想到long long)
3.N=10005,这样子数组范围是肯定过不了的,为了防止出错,需要检查,或者直接1e5+5;
1.暴力做法
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100005;
int a[N], b[N], c[N];
typedef long long ll;
int main()
{
int n;
cin >> n;
for (int i = 0;i < n;i++)
cin >> a[i];
for (int i = 0;i < n;i++)
cin >> b[i];
for (int i = 0;i < n;i++)
cin >> c[i];
ll res = 0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for (int k =0;k < n;k++)
{
if(a[i]<b[j]&&b[j]<c[k])
res++;
}
cout << res;
}
2.二分查找
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5+5;
int a[N], b[N], c[N];
typedef long long ll;
int n;
/*
1<=i,j,k<=n;
A<B<C 数据范围是10^5, --》n(logn)或者 n 的做法
*/
int left_bound(int x)
{
int l = 0, r =n;
while (l < r)
{
int mid = l + r >> 1;
if (x < a[mid])
r = mid;
else if (a[mid] == x)
r = mid;
else if ( x > a[mid])
l = mid + 1;
}
return l;
}
int right_bound(int x)
{
int l = 0, r = n;
while (l < r)
{
int mid = l + r >> 1;
if (x < c[mid])
r = mid;
else if (x > c[mid])
l = mid + 1;
else
l = mid + 1;
}
return l;
}
int main()
{
cin >> n;
for (int i = 0;i < n;i++)
cin >> a[i];
for (int i = 0;i < n;i++)
cin >> b[i];
for (int i = 0;i < n;i++)
cin >> c[i];
ll res = 0;
sort(a, a + n);
sort(b, b + n);
sort(c, c + n);
for (int i = 0;i < n;i++)
{
ll a1 = left_bound(b[i]); //几个比b[i]小的数
ll c1 =n-right_bound(b[i]); //几个比b[i]大的数
res += a1 * c1;
}
cout << res;
}