成套比赛题解

https://blog.csdn.net/qq_29556211/article/details/78130052 +

2016-2017 ACM-ICPC, Asia Tsukuba Regional Contest
https://blog.csdn.net/sinat_32872703/article/details/72764671

https://blog.csdn.net/qwerty1125/article/details/78036449 +

2017-2018 ACM-ICPC, Asia Daejeon Regional Contest
http://blog.myungwoo.kr/121
https://www.cnblogs.com/skyette/p/8271006.html

http://www.cnblogs.com/flipped/p/6401218.html +

csdn 博客专题收割

https://blog.csdn.net/zhuanshunzhe/article/details/72758063
https://blog.csdn.net/fouzhe/article/category/6467108
https://blog.csdn.net/chenzhenyu123456/article/category/5585753
https://blog.csdn.net/black_miracle/article/details/70990707
https://blog.csdn.net/black_miracle/article/details/70990752
https://blog.csdn.net/Mitsuha_/article/details/79395066

线性基深入了解

https://blog.csdn.net/qwb492859377/article/details/52944803
https://blog.csdn.net/qwb492859377/article/details/52939589

置换群
https://blog.csdn.net/chenzhenyu123456/article/category/5585753
https://blog.csdn.net/qq_37383726/article/details/78598519

BZOJ资料合集 https://blog.csdn.net/CreationAugust/article/details/51205469

java 自定义排序

import java.util.*;

public class Main{
    public static void main(String args[]){
        Scanner vin = new Scanner(System.in);
        Meo[] rec = new Meo[104];
        int n, i, j;
        int[] a = new int[4];
        while(vin.hasNext()){
            n = vin.nextInt();
            for(i = 0; i < n; i++){
                for(j = 0; j < 3; j++){
                    a[j] = vin.nextInt();
                }
                rec[i] = new Meo(a[0], a[1], a[2]);
            }
            Arrays.sort(rec, 0, n, new Comparator<Meo>(){
                public int compare(Meo t1, Meo t2){
                    if(t1.sum < t2.sum)
                        return 1;
                    else 
                        return -1;
                }
            });
            for(i = 0; i < n; i++){
                System.out.printf("%d\n", rec[i].sum);
            }
        }
        vin.close();
    }
}
class Meo{
    int x, y, z, sum;
    Meo(int x, int y, int z){
        this.x = x;
        this.y = y;
        this.z = z;
        this.sum = x+y+z;
    }
}

import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.math.*;

import static java.lang.System.out;

class Node implements Comparable<Node> {
    int x, y, z;
    public int getsum(){
        return this.x+this.y+this.z;
    }
    @Override
    public int compareTo(Node o) {
        return o.getsum()-this.getsum();
    }
}

public class Main {

    public static void main(String[] args) {
        List<Node> list = new ArrayList<Node>();
        Scanner cin = new Scanner(System.in);
        int T = cin.nextInt();

        for (int a = 0; a < T; a++) {
            Node tmp = new Node();
            tmp.x = cin.nextInt();
            tmp.y = cin.nextInt();
            tmp.z = cin.nextInt();
            list.add(tmp);
        }
        Collections.sort(list);
        for (Node x : list) {
            out.println(x.getsum());
        }
    }
}


2013年多校训练赛

1 https://blog.csdn.net/keshuai19940722/article/details/49797717
http://www.xuebuyuan.com/1770266.html
best 官方博客 http://bestcoder.hdu.edu.cn/blog/2017-multi-university-training-contest-9-solutions-by-%E5%8C%97%E4%BA%AC%E9%82%AE%E7%94%B5%E5%A4%A7%E5%AD%A6/

https://blog.csdn.net/watermuch/article/details/10083571

2017 区域赛现场赛题解

关键词 ACM-ICPC 2017 Asia Urumqi
1 ECL-final https://blog.csdn.net/mrbird_to_fly/article/details/78833241
2 https://blog.csdn.net/w326159487/article/details/79186273 二分答案
3
乌鲁木齐 矩阵快速幂
https://blog.csdn.net/Mitsuha_/article/details/79395066
https://blog.csdn.net/Mitsuha_/article/details/79307175
5 code+
https://www.cnblogs.com/Sakits/p/8097744.html
https://www.cnblogs.com/Sakits/p/8099398.html
https://blog.csdn.net/wang3312362136/article/details/78646100
6 乌鲁木齐D https://blog.csdn.net/Lakersilk/article/details/79508863