想用dp，发现前后互相影响。其实不用这么复杂，从中心点向外扩散即可。
代码：
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 0x3f3f3f3f;
const int MAXN = 500;
int T;
ll N;
ll dp[MAXN][MAXN];
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
cin >> T;
while(T--) {
cin >> N;
ll ans = 0;
for(int i=1; 2*i+1<=N; i++) {
ans += 1LL*((2*i+1)*4-4)*i;
}
cout << ans << endl;
}
}
想用dp，发现前后互相影响。其实不用这么复杂，从中心点向外扩散即可。代码：
不错的天气，不错的心情，第一次用 go 语言做题。 翻译 很长的题目，翻译错了思考了半小时，然后发现翻译错了，水题...
White Board Black Board Chalk Board Pen BlackBoard Eraser...
This is a funny game. It moves the obstacles in front of ...
Minimum Moves to Equal Array Elements II
Look at the board，看黑板 Write on the board，写到黑板上 Dictate a ...
Review Board Centos 6.4 : Review Board Centos Svn : Subve...
The Red Kangaroo is a famous Australian animal. It moves ...
A block device is one in which the data that moves to and...
多维数组的指针： 假设有一个char型数组 board[3][3] *board→board[0] 等价于 &bo...
本文标题：642div2 - C. Board Moves
本文链接：https://www.haomeiwen.com/subject/cfwrahtx.html
网友评论