zoukankan      html  css  js  c++  java
  • POJ2481(树状数组:统计数字 出现个数)

    Cows
    Time Limit: 3000MS   Memory Limit: 65536K
    Total Submissions: 15405   Accepted: 5133

    Description

    Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good. 

    Farmer John has N cows (we number the cows from 1 to N). Each of Farmer John's N cows has a range of clover that she particularly likes (these ranges might overlap). The ranges are defined by a closed interval [S,E]. 

    But some cows are strong and some are weak. Given two cows: cowi and cowj, their favourite clover range is [Si, Ei] and [Sj, Ej]. If Si <= Sj and Ej <= Ei and Ei - Si > Ej - Sj, we say that cowi is stronger than cowj

    For each cow, how many cows are stronger than her? Farmer John needs your help!

    Input

    The input contains multiple test cases. 
    For each test case, the first line is an integer N (1 <= N <= 105), which is the number of cows. Then come N lines, the i-th of which contains two integers: S and E(0 <= S < E <= 105) specifying the start end location respectively of a range preferred by some cow. Locations are given as distance from the start of the ridge. 

    The end of the input contains a single 0.

    Output

    For each test case, output one line containing n space-separated integers, the i-th of which specifying the number of cows that are stronger than cowi

    Sample Input

    3
    1 2
    0 3
    3 4
    0
    

    Sample Output

    1 0 0
    题意:统计每个区间是多少个区间的真子集。
    #include"cstdio"
    #include"cstring"
    #include"algorithm"
    using namespace std;
    const int MAXN=100005;
    struct Node{
        int S,E;
        int index;
    }cows[MAXN];
    bool comp(const Node &a,const Node &b)
    {
        if(a.E==b.E)    return a.S < b.S;
        else    return a.E > b.E;
    }
    int bit[MAXN];
    void add(int i,int x)
    {
        while(i<MAXN)
        {
            bit[i]+=x;
            i+=i&(-i);
        }
    }
    int sum(int i)
    {
        int s=0;
        while(i>0)
        {
            s+=bit[i];
            i-=i&(-i);
        }
        return s;
    }
    int res[MAXN];
    int main()
    {
        int n;
        while(scanf("%d",&n)!=EOF&&n!=0)
        {
            memset(bit,0,sizeof(bit));
            memset(res,0,sizeof(res));
            for(int i=0;i<n;i++)
            {
                scanf("%d%d",&cows[i].S,&cows[i].E);
                cows[i].S++;// 存在 0 
                cows[i].E++;    
                cows[i].index=i;
            }
            sort(cows,cows+n,comp);
            add(cows[0].S,1);
            for(int i=1;i<n;i++)
            {
                if(cows[i].E==cows[i-1].E&&cows[i].S==cows[i-1].S)
                {
                    res[cows[i].index]=res[cows[i-1].index];
                }
                else
                {
                    res[cows[i].index]=sum(cows[i].S);
                }
                add(cows[i].S,1);
            }
            for(int i=0;i<n-1;i++)
            {
                printf("%d ",res[i]);
            }
            printf("%d
    ",res[n-1]);
        }
    
        return 0;
    }
  • 相关阅读:
    POJ 3660 Cow Contest (floyd求联通关系)
    POJ 3660 Cow Contest (最短路dijkstra)
    POJ 1860 Currency Exchange (bellman-ford判负环)
    POJ 3268 Silver Cow Party (最短路dijkstra)
    POJ 1679 The Unique MST (最小生成树)
    POJ 3026 Borg Maze (最小生成树)
    HDU 4891 The Great Pan (模拟)
    HDU 4950 Monster (水题)
    URAL 2040 Palindromes and Super Abilities 2 (回文自动机)
    URAL 2037 Richness of binary words (回文子串,找规律)
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5138612.html
Copyright © 2011-2022 走看看