1149. 【克罗地亚】LAGNO

最新推荐文章于 2019-01-29 22:02:06 发布

Yongqian-Peng

最新推荐文章于 2019-01-29 22:02:06 发布

阅读量1k

点赞数 1

分类专栏： TJ 文章标签： PASCAL

本文链接：https://blog.csdn.net/mkmmkd/article/details/51851969

版权

TJ 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

T2：A了，一道水题，就是翻转棋，只要往每一个点八个方向找就ok。大概

uses
    math;
var
    i,j,n,s,t,ans,tans:longint;
    a:array[0..10,0..10]of char;
function get(x,y:longint):longint;
var
    i,j:longint;
begin
        get:=0;
        if a[x,y]<>'.' then
                exit(0);
    if a[x+1,y]='W' then
    begin
        i:=x+1;
        while (i<8)and(a[i,y]<>'.') do
        begin
            inc(i);
            if a[i,y]='B' then
            begin
                inc(get,i-x-1);
                break;
            end;
        end;

    end;
    if a[x-1,y]='W' then
    begin
        i:=x-1;
        while (i>1)and(a[i,y]<>'.') do
        begin
            dec(i);
            if a[i,y]='B' then
            begin
                inc(get,x-i-1);
                break;
            end;
        end;

    end;
    if a[x,y+1]='W' then
    begin
        i:=y+1;
        while (i<8)and(a[x,i]<>'.') do
        begin
            inc(i);
            if a[x,i]='B' then
            begin
                inc(get,i-y-1);
                break;
            end;
        end;

    end;
    if a[x,y-1]='W' then
    begin
        i:=y-1;
        while (i>1)and(a[x,i]<>'.') do
        begin
            dec(i);
            if a[x,i]='B' then
            begin
                inc(get,y-i-1);
                break;
            end;
        end;
    end;
    if a[x+1,y+1]='W' then
    begin
        i:=x+1;
        j:=y+1;
        while (i<8)and(j<8)and(a[i,j]<>'.') do
        begin
            inc(i);
            inc(j);
            if a[i,j]='B' then
            begin
                inc(get,j-y-1);
                break;
            end;
        end;
    end;
    if a[x+1,y-1]='W' then
    begin
        i:=x+1;
        j:=y-1;
        while (i<8)and(j>1)and(a[i,j]<>'.') do
        begin
            inc(i);
            dec(j);
            if a[i,j]='B' then
            begin
                inc(get,y-j-1);
                break;
            end;
        end;
    end;
    if a[x-1,y+1]='W' then
    begin

        i:=x-1;
        j:=y+1;
        while (i>1)and(j<8)and(a[i,j]<>'.') do
        begin
            dec(i);
            inc(j);
            if a[i,j]='B' then
            begin
                inc(get,j-y-1);
                break;
            end;
        end;
    end;
    if a[x-1,y-1]='W' then
    begin
        i:=x-1;
        j:=y-1;
        while (i>1)and(j>1)and(a[i,j]<>'.') do
        begin
            dec(i);
            dec(j);
            if a[i,j]='B' then
            begin
                inc(get,y-j-1);
                break;
            end;
        end;
    end;
    exit(get);
end;
begin
    //assign(input,'b.in');reset(input);
    for i:=1 to 8 do
    begin
        for j:=1 to 8 do
        begin
            read(a[i,j]);
        end;
                readln;
    end;
    for i:=1 to 8 do
    begin
        for j:=1 to 8 do
                begin
            ans:=max(ans,get(i,j));
        end;
    end;
    writeln(ans);
end.