[codility]Number-of-disc-intersections

最新推荐文章于 2021-04-11 04:52:58 发布

AI记忆

最新推荐文章于 2021-04-11 04:52:58 发布

阅读量1.6k

点赞数

分类专栏： codility 面试编程训练

本文链接：https://blog.youkuaiyun.com/sunbaigui/article/details/16983837

版权

面试编程训练同时被 2 个专栏收录

93 篇文章

订阅专栏

codility

39 篇文章

订阅专栏

本文介绍了一种使用C++解决区间重叠数量问题的方法，通过定义区间段结构体并使用二分搜索算法优化计算过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// you can also use includes, for example:
#include <algorithm>
struct IntervalSeg
{
    long long left, right;
    IntervalSeg(long long _left = 0, long long _right = 0):left(_left),right(_right){}
    bool operator<(const IntervalSeg& orh) const
    {
        if(left == orh.left) return right < orh.right;
        else return left < orh.left;
    }
};

int getFirstBiggerIdx(const vector<IntervalSeg>& intervalSeg, long long target)
{
    int left = 0;
    int right = intervalSeg.size()-1;
    while(left <= right)
    {
        int mid = left+(right-left)/2;
        if(intervalSeg[mid].left > target) right = mid-1;
        else left = mid+1;
    }
    return left;
}
int solution(const vector<int> &A) {
    // write your code in C++98
    //...convert original problem to counting overlap number of given interval segments
    vector<IntervalSeg> intervalSeg(A.size());
    for(int i = 0; i < A.size(); ++i)
    {
        intervalSeg[i].left = intervalSeg[i].right = i;
        intervalSeg[i].left -= A[i];
        intervalSeg[i].right += A[i];
    }
    //...first interval segments first
    sort(intervalSeg.begin(), intervalSeg.end());
    //...enumerate each interval segment and using binary search to calculate how much interval segments overlap it
    long long result = 0;
    for(int i = 0; i < intervalSeg.size(); ++i)
    {
        long long curRight = intervalSeg[i].right;
        int firstBiggerIdx = getFirstBiggerIdx(intervalSeg, curRight);
        result += firstBiggerIdx-i-1;
    }
    //...return result
    long long MAX_LIMIT = 10000000;
    if(result > MAX_LIMIT) return -1;
    else return (int)result;
}