Oyking

摘要： Description给你一个m*n的格子的棋盘，每个格子里面有一个非负数。 从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括2整数m,n和m*n个非负数(m 2 #include 3 #include 4 #include 5 using namespace std; 6 7 const int MAXN = 3000; 8 const int MAXE = 30010; 9 const int INF = 0x3fff3fff; 10 11 struct ... 阅读全文

摘要： DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in them×ngrid yard of one their main weapon factories in order to 阅读全文