CSP 201512-3 画图

最新推荐文章于 2020-04-18 18:44:25 发布

原创最新推荐文章于 2020-04-18 18:44:25 发布 · 211 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

CSP 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一种基于递归的填充算法，通过优化递归边界条件，从初始的40分提升至60分。算法在二维数组中进行字符填充，并处理边界划定，涉及递归调用、边界检查及字符绘制。

开始是40分，改进了递归的边界条件后，变为了60分、、、、

#include"iostream"
using namespace std;
int m, n, q;
char a[105][105];
struct {
   int num, x1, y1, x2, y2;
   char ch;
}b[105];
int driX[4] = { 0,0,1,-1 };
int driY[4] = { 1,-1,0,0 };
int M;
void fill(int k, int l, int i) {
   m > n ? M = m : M = n;
   if (k < 0 || k >=M|| l < 0 || l >= n) return;
   if (a[n - 1 - l][k] == '+' || a[n - 1 - l][k] == '-' || a[n - 1 - l][k] == '|' || a[n - 1 - l][k] == b[i].ch)
       return;
   a[n - 1 - l][k] = b[i].ch;

for (int o = 0; o < 4; o++) {
fill(k + driX[o], l + driY[o], i);

}
if (k < 0 || k >= n || l < 0 || l >= m) return;
}

int main() {
   cin >> m >> n >> q;
   for (int i = 0; i < n; i++)
       for (int j = 0; j < m; j++)
           a[i][j] = '.';
   int min, max;
   for (int i = 0; i < q; i++) {
       cin >> b[i].num;
       if (b[i].num == 0) {//划定边界
           cin >> b[i].x1 >> b[i].y1 >> b[i].x2 >> b[i].y2;
           //a[b[i].x1][b[i].y1] = )
           if (b[i].x1 == b[i].x2) {
               if (b[i].y1 < b[i].y2) {
                   min = b[i].y1;
                   max = b[i].y2;
               }
               else {
                   max = b[i].y1;
                   min = b[i].y2;
               }
               a[n - 1 - min][b[i].x1] = '+';
               a[n - 1 - max][b[i].x1] = '+';
               for (int j = min + 1; j < max; j++) {
                   a[n - 1 - j][b[i].x1] = '|';
               }
           }
           else if (b[i].y1 == b[i].y2) {
               if (b[i].x1 < b[i].x2) {
                   min = b[i].x1;
                   max = b[i].x2;
               }
               else {
                   max = b[i].x1;
                   min = b[i].x2;
               }
               a[n - 1 - b[i].y1][min] = '+';
               a[n - 1 - b[i].y1][max - 1] = '+';
               for (int j = min + 1; j < max; j++) {
                   a[n - 1 - b[i].y1][j] = '-';
               }
           }

       }
       else {//开始填充字符
           cin >> b[i].x1 >> b[i].y1 >> b[i].ch;
           fill(b[i].x1, b[i].y1, i);
       }
   }
   for (int i = 0; i < n; i++) {
       int j;
       for ( j = 0; j < m; j++) {
           cout << a[i][j];
       }
       if (i!= n)
           cout << "\n";
   }
}