摘要： 题目链接。分析：状态转移方程 d[i][j] = max(d[i-1][j], d[i+1][j], d[i][j-1], d[i][j+1])。#include #include #include #include #include #include #include using namespace std;const int maxn = 100+10;int a[maxn][maxn], d[maxn][maxn], n, m;int dx[] = {0, 0, -1, 1};int dy[] = {-1, 1, 0, 0};int dfs(int x, int y) { if(d... 阅读全文

摘要： 题目链接。分析：水题一道。#include #include #include #include #include #include #include using namespace std;int cmp(double x, double y) { if(x-y> n) { if(n == 0) break; int item = 2; double sum = 0; while(cmp(sum, n) == -1) { sum += 1.0/item; item++; }... 阅读全文