博客
关于我
AcWing 143. 最大异或对
阅读量:346 次
发布时间:2019-03-04

本文共 2069 字,大约阅读时间需要 6 分钟。

????????????????????????????????????????????????????????????????????????????????

????

????????????Trie????????????Trie?????????????????????????1????????????????????????????????Trie??????????????????

???????

  • ???Trie???
  • ???????????Trie????????????????????
  • ??????????Trie??????????????????????????????
  • ???????????
  • ????

    import java.io.*;import java.lang.Integer;class Main {    static int N = 3000010; // ??N???1000000    static int[][] t = new int[N][2];    static int idx = 0;    static void insert(int num) {        int p = 0;        for (int x = 30; x >= 0; --x) {            int c = (num >> x) & 1;            if (t[p][c] == 0) {                t[p][c] = ++idx;            }            p = t[p][c];        }    }    static int compare(int num) {        int p = 0;        int max = 0;        for (int x = 30; x >= 0; --x) {            int c = (num >> x) & 1;            if (t[p][1 - c] == 0) {                max = (max << 1) | 1;                p = t[p][c];            } else {                max = (max << 1) | 0;                p = t[p][c];            }        }        return max;    }    public static void main(String[] args) throws Exception {        BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));        BufferedWriter buw = new BufferedWriter(new OutputStreamWriter(System.out));        int n = Integer.valueOf(buf.readLine());        String[] params = buf.readLine().split(" ");        for (int i = 0; i < n; ++i) {            int num = Integer.valueOf(params[i]);            insert(num);        }        int max = 0;        for (int i = 0; i < n; ++i) {            int num = Integer.valueOf(params[i]);            int m = compare(num);            if (m > max) {                max = m;            }        }        buw.write(max + "");        buw.flush();        buf.close();        buw.close();    }}

    ????

  • Trie???????????t???Trie??????????????????????0?1?
  • ????insert?????????Trie?????????????????????????????
  • ????compare???????Trie?????????????????????
  • ???main????????????Trie??????????????????
  • ????????????O(N)??????????????????

    转载地址:http://rkre.baihongyu.com/

    你可能感兴趣的文章
    POJ 2362 Square DFS
    查看>>
    Qt笔记——解决添加Qt Designer Form Class时“allocation of incomplete type Ui::”
    查看>>
    poj 2386 Lake Counting(BFS解法)
    查看>>
    poj 2387 最短路模板题
    查看>>
    POJ 2391 多源多汇拆点最大流 +flody+二分答案
    查看>>
    POJ 2403
    查看>>
    poj 2406 还是KMP的简单应用
    查看>>
    POJ 2431 Expedition 优先队列
    查看>>
    Qt笔记——获取位置信息的相关函数
    查看>>
    POJ 2484 A Funny Game(神题!)
    查看>>
    POJ 2486 树形dp
    查看>>
    POJ 2488:A Knight&#39;s Journey
    查看>>
    SpringBoot为什么易学难精?
    查看>>
    poj 2545 Hamming Problem
    查看>>
    poj 2723
    查看>>
    poj 2763 Housewife Wind
    查看>>
    Qt笔记——模型/视图MVD 文件目录浏览器软件
    查看>>
    POJ 2892 Tunnel Warfare(树状数组+二分)
    查看>>
    poj 2965 The Pilots Brothers' refrigerator-1
    查看>>
    poj 3026( Borg Maze BFS + Prim)
    查看>>