{"trustable":false,"sections":[{"title":"","value":{"format":"PLAIN","content":"有n台电脑(2\u003c\u003dn\u003c\u003d20),任意两台电脑i,j之间都有网线连接,价值为Cij(0\u003c\u003dCij\u003c\u003d10000),保证Cij\u003dCji,且Cii\u003d0。\n你需要将所有电脑分为两部分,对于所有不属于同一部分的两台电脑i,j,能够获得它们的价值Cij。要求使得总价值最大,输出该总价值。"}},{"title":"Input","value":{"format":"PLAIN","content":"第一行一个整数n。\n接下来n行,每行有n个整数,表示Cij。"}},{"title":"Output","value":{"format":"PLAIN","content":"仅一行,一个整数,表示最大总价值。"}},{"title":"Sample Input","value":{"format":"PLAIN","content":"3\n0 50 30\n50 0 40\n30 40 0"}},{"title":"Sample Output","value":{"format":"PLAIN","content":"90"}}]}