锘??xml version="1.0" encoding="utf-8" standalone="yes"?>精品99久久aaa一级毛片,久久精品国产精品亚洲,九九热久久免费视频http://www.shnenglu.com/master0503/category/8194.html涓嶉爤璦堣純鑸囧畨鎺?闋樺彇鑰屼粖鐝懼湪zh-cnMon, 24 Nov 2008 06:36:18 GMTMon, 24 Nov 2008 06:36:18 GMT602182 Lost Cowshttp://www.shnenglu.com/master0503/articles/67624.html騫繪氮澶╃┖棰嗕富騫繪氮澶╃┖棰嗕富Sat, 22 Nov 2008 12:36:00 GMThttp://www.shnenglu.com/master0503/articles/67624.htmlhttp://www.shnenglu.com/master0503/comments/67624.htmlhttp://www.shnenglu.com/master0503/articles/67624.html#Feedback0http://www.shnenglu.com/master0503/comments/commentRss/67624.htmlhttp://www.shnenglu.com/master0503/services/trackbacks/67624.htmlLost Cows
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 2824 Accepted: 1742

Description

N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before dinner. When it was time to line up for their evening meal, they did not line up in the required ascending numerical order of their brands.

Regrettably, FJ does not have a way to sort them. Furthermore, he's not very good at observing problems. Instead of writing down each cow's brand, he determined a rather silly statistic: For each cow in line, he knows the number of cows that precede that cow in line that do, in fact, have smaller brands than that cow.

Given this data, tell FJ the exact ordering of the cows.

Input

* Line 1: A single integer, N

* Lines 2..N: These N-1 lines describe the number of cows that precede a given cow in line and have brands smaller than that cow. Of course, no cows precede the first cow in line, so she is not listed. Line 2 of the input describes the number of preceding cows whose brands are smaller than the cow in slot #2; line 3 describes the number of preceding cows whose brands are smaller than the cow in slot #3; and so on.

Output

* Lines 1..N: Each of the N lines of output tells the brand of a cow in line. Line #1 of the output tells the brand of the first cow in line; line 2 tells the brand of the second cow; and so on.

Sample Input

5
1
2
1
0

Sample Output

2
4
5
3
1

Source



Analysis

Which number can we determine at the first glance of the input data? Of course, the answer is the tail. Suppose the last number of the input data, which is the number of cows with lower brand number than it, is a[n]. According to the defination, the last cow gets the (a[n]+1)th number, since there are a[n] brand number before. What's more, the brand number is constrained in range from 1 to n, so the last number is well ensured.

Later, the earlier one will be determined in a set containing the numbers range from 1 to n except b[n], which is the brand number of the last cow. Obviously, the brand number is the (a[n-1]+1)th number in the set. The problem turns to be the method to save and search used numbers. If we create a constantly array, the cost of time in deleting and searching is both O(n) and the whole cost is o(n^2). Just consider about the segment tree. Create a segment tree of range [1,n], and the number of tree[p] is the number of brands used. When a number is inserting, calculate the remaining number of the left range: m-l+1-tree[p]. If it is larger than the current number, which is a[i]+1, then searching the left child. Otherwise, search the right one. When it is searching, adding the current root since it is clear to see that a new member is coming now. At last, when the search comes to an end and find a leave, record the range number.

My code:

#include <stdio.h>
#include 
<stdlib.h>
#include 
<memory.h>
#define MAX 8000

int main(){
    
int n,i;
    
int a[MAX],b[MAX];
    
int tree[4*MAX+1];
    scanf(
"%d",&n);
    a[
0]=0;
    
for (i=1;i<n;i++)
        scanf(
"%d",a+i);
    
for (i=n-1;i>=0;i--){
        
int l,r,p,m,no;
        no
=a[i]+1;
        l
=1;r=n;p=1;
        
while (l<r){
            tree[p]
++;
            m
=(l+r)>>1;
            
if (m-l+1-tree[2*p]>=no ){
                r
=m;
                p
<<=1;
            }

            
else {
                no
-=m-l+1-tree[2*p];
                l
=m+1;
                p
=2*p+1;                
            }

        }

        tree[p]
++;
        b[i]
=l;
    }

    
for (i=0;i<n;i++)
        printf(
"%d\n",b[i]);
    
return 0;
}



騫繪氮澶╃┖棰嗕富 2008-11-22 20:36 鍙戣〃璇勮
]]>
午夜精品久久久久久久无码| 99精品伊人久久久大香线蕉| 欧美亚洲国产精品久久| 午夜精品久久久久久影视777| 综合久久给合久久狠狠狠97色 | 日本强好片久久久久久AAA| 伊人久久大香线蕉AV色婷婷色| 99久久久精品| 欧美色综合久久久久久| 蜜臀av性久久久久蜜臀aⅴ麻豆| 香港aa三级久久三级| 亚洲国产高清精品线久久| 久久精品国产亚洲AV麻豆网站 | 亚洲国产精品久久久久| 久久99热这里只有精品66| 久久99热国产这有精品| 狠狠色丁香久久婷婷综合_中| 高清免费久久午夜精品| 久久久国产打桩机| 99久久精品国产一区二区三区| 欧美日韩精品久久免费| 久久亚洲中文字幕精品一区四| 国产成人久久激情91| 亚洲乱码精品久久久久..| 亚洲AⅤ优女AV综合久久久| 亚洲精品高清久久| 成人妇女免费播放久久久| 狠狠色丁香婷婷久久综合| 久久久久久国产精品美女| 99久久精品免费观看国产| 久久精品无码一区二区三区| 日韩AV无码久久一区二区| 亚洲精品乱码久久久久久中文字幕 | 久久AAAA片一区二区| 2021少妇久久久久久久久久| 久久免费的精品国产V∧| 亚洲国产欧洲综合997久久| 精品无码久久久久国产动漫3d| 国产香蕉久久精品综合网| 久久久SS麻豆欧美国产日韩| 精品无码久久久久国产动漫3d|