Problem:↵
↵
There is a $n\times n$ grid,you must choose $n$ numbers from it and you must guarantee that any two points cannot be in the same row or column.Maximize the sum of the numbers you've chosen and print it.↵
↵
$n\leq 2000$.
↵
There is a $n\times n$ grid,you must choose $n$ numbers from it and you must guarantee that any two points cannot be in the same row or column.Maximize the sum of the numbers you've chosen and print it.↵
↵
$n\leq 2000$.
