【二分法】递增三元组

Nathan Qian

已于 2022-02-08 18:04:25 修改

阅读量399

点赞数 2

分类专栏：蓝桥刷题冲冲！文章标签：二分法

于 2022-02-08 11:12:46 首次发布

本文链接：https://blog.csdn.net/nathanqian123/article/details/122820198

版权

蓝桥刷题冲冲！专栏收录该内容

58 篇文章 1 订阅

订阅专栏

题目

解释

固定中间的b[i]
然后用二分查找a[i]第一个大于等于b[i]的下标j
二分查找c[i]严格大于b[i]的下标k
ans更新加等于(j-1)*(n-k+1)
可以用stl做，也可以手写二分模板
lower_bound 返回第一个大于等于b[i]的地址，注意要减去首地址才能得下标
如果找不到则返回最后一个地址
upper_bound返回第一个严格大于b[i]的地址，注意同上
如果找不到则返回最后一个地址

代码段

手写

#include<iostream>
#include<algorithm>
const int N = 1e5 + 10;
int a[N], b[N], c[N];
long long ans;
#define ll long long
using namespace std;
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++)
        scanf("%d", &b[i]);
    for (int i = 1; i <= n; i++)
        scanf("%d", &c[i]);
    sort(a + 1, a + n + 1);
    sort(b + 1, b + n + 1);
    sort(c + 1, c + n + 1);
    for (int i = 1; i <= n; i++)
    {
        int l = 0, r = n+1;
        while (l < r)
        {
            int mid = (l + r) / 2;
            if (a[mid] >= b[i])r= mid;
            else
                l = mid+1;
        }
        if (l>0)//找到了第一个大于等于b[i]的下标为l
        {
            ll j = l - 1;
            int l = 0, r = n+1;
            while (l < r)//找最后个小于等于b[i]的下标为l
            {
                int mid = (l + r + 1) / 2;
                if (c[mid] <= b[i])l = mid;
                else
                    r = mid - 1;
            }
            ll k;
            if (r<n+1)
                
                { 
            k = n - r;
            ans += k * j;
                }
        }
    }
    cout<<ans<<endl;

}

stl

#include<iostream>
#include<algorithm>
#define _CRT_SECURE_NO_WARNINGS
const int N = 1e5 + 10;
int a[N], b[N], c[N];
long long ans;
#define ll long long
using namespace std;
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    for (int i = 1; i <= n; i++)
        cin >> c[i];
    sort(a + 1, a + n + 1);
    sort(b + 1, b + n + 1);
    sort(c + 1, c + n + 1);
    for (int i = 1; i <= n; i++)
    {
        ll x = (long long)(bound(a + 1, a + 1 + n, b[i])-a)-1;//第一个大于等于某个数的下标
        ll y = (long long)n - (upper_bound(c + 1, c + 1 + n, b[i])-c) + 1;
        ans += x * y;
    }
    cout << ans << endl;
    return 0;
   



}