0w1

Entries from 2017-01-21 to 1 day

CFR 650 C. Table Compression ( Union Find )

Problem - C - Codeforces題意: 給你一個數值矩陣。要你將數值塗改,使得最大的數字最小,但在:所有行,或所有列裡,原本數值的大小關係皆不改變。資料規模: The first line of the input contains two integers n and m (, the number of rows and the n…