POJ 归并排序求逆序对

求逆序对


import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;



public class Main {
	
	public static void main(String[] args) {
		   new POJ2299().solve()  ;	
	}

}

class POJ2299{
	
	InputReader in = new InputReader(System.in) ;
	PrintWriter out = new PrintWriter(System.out) ;
	
	void solve(){
		while(true){
			int n = in.nextInt()  ;
			if(n == 0) break ;
			int[] a = new int[n] ;
			for(int i = 0 ; i < n ; i++) a[i] = in.nextInt() ;
			out.println(mergSort(a, 0, n-1)) ;
		}
		out.flush() ;
	}
	
	long mergSort(int[] a , int l , int r){
		long res = 0 ;
		if(l == r) return res ;
		int m = (l + r) >> 1 ;
		res += mergSort(a, l, m) ;
		res += mergSort(a, m+1, r) ;
		int[] t = new int[r-l+1] ;
		int i = l , j = m+1 , id = 0  ;
		while(i <= m && j <= r){
			if(a[i] <= a[j]){
				t[id++] = a[i++] ;
			}
			else{
				t[id++] = a[j++] ;
				res += m - i + 1 ;
			}
		}
		while(i <= m) t[id++] = a[i++] ;
		while(j <= r) t[id++] = a[j++] ;
	    System.arraycopy(t, 0 , a , l , r-l+1) ;
		return res ; 
	}
	
}


class InputReader {    
    public BufferedReader reader;    
    public StringTokenizer tokenizer;    
    
    public InputReader(InputStream stream) {    
        reader = new BufferedReader(new InputStreamReader(stream), 32768);    
        tokenizer = new StringTokenizer("");    
    }    
    
    private void eat(String s) {    
        tokenizer = new StringTokenizer(s);    
    }    
    
    public String nextLine() {    
        try {    
            return reader.readLine();    
        } catch (Exception e) {    
            return null;    
        }    
    }    
    
    public boolean hasNext() {    
        while (!tokenizer.hasMoreTokens()) {    
            String s = nextLine();    
            if (s == null)    
                return false;    
            eat(s);    
        }    
        return true;    
    }    
    
    public String next() {    
        hasNext();    
        return tokenizer.nextToken();    
    }    
    
    public int nextInt() {    
        return Integer.parseInt(next());    
    }    
    
    public long nextLong() {    
        return Long.parseLong(next());    
    }    
    
    public double nextDouble() {    
        return Double.parseDouble(next());    
    }    
    
    public BigInteger nextBigInteger() {    
        return new BigInteger(next());    
    }    
    
}    


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值