poj3251 & usaco 月赛 2006 Big Square 题解
来源:互联网 发布:办公软件word 编辑:程序博客网 时间:2024/06/06 23:01
转载请注明:http://blog.csdn.net/jiangshibiao/article/details/23361659
【原题】
Description
Farmer John's cows have entered into a competition with Farmer Bob's cows. They have drawn lines on the field so it is a square grid with N × N points (2 ≤ N ≤ 100), and each cow of the two herds has positioned herself exactly on a gridpoint. Of course, no two cows can stand in the same gridpoint. The goal of each herd is to form the largest square (not necessarily parallel to the gridlines) whose corners are formed by cows from that herd.
All the cows have been placed except for Farmer John's cow Bessie. Determine the area of the largest square that Farmer John's cows can form once Bessie is placed on the field (the largest square might not necessarily contain Bessie).
Input
Lines 2..N+1: Line i+1 describes line i of the field with N characters. The characters are: 'J' for a Farmer John cow, 'B' for a Farmer Bob cow, and '*' for an unoccupied square. There will always be at least one unoccupied gridpoint.
Output
Sample Input
6J*J*********J***J*********B*********
Sample Output
4
Source
【题意】
给定N*N的图,包括"B","*","J"三种情况。你要选择4个'J'点或者是3个'J'点和一个'*’点作为正方形的四个顶点。求正方形的最大面积。
【分析】网上说是二分图或是枚举对角线(事后查的O(∩_∩)O~~)。然而我已开始不知情,想用低空飞行法。每次枚举两个顶点,通过计算算出另外两个并判断。效率是N^4。
【原程序】
#include<cstdio>#include<algorithm>char map[201][201],enter;int n,i,j,x,y,p,q,ans;using namespace std;inline int ok(int o1,int o2,int o3,int o4){ return (o1>=0&&o2>=0&&o3>=0&&o4>=0);}int main(){ scanf("%d",&n); for (i=1;i<=n;i++) { scanf("%c",&enter); for (j=1;j<=n;j++) scanf("%c",&map[i][j]); } for (x=1;x<=n;x++) for (y=1;y<=n;y++) if (map[x][y]=='J') for (i=1;i<=n;i++) for(j=1;j<=n;j++) if (map[i][j]=='*'||map[i][j]=='J') { p=i-x;q=j-y; if (ok(x-q,i-q,y+p,j+p)&&(map[x-q][y+p]=='J')&&(map[i-q][j+p]=='J')) ans=max(ans,p*p+q*q); if (ok(y-p,j-p,i+q,x+q)&&(map[x+q][y-p]=='J')&&(map[i+q][j-p]=='J')) ans=max(ans,p*p+q*q); } printf("%d",ans); return 0;}
【漫长的改进之旅】感谢HHD大牛的辛勤调试!使我原来7.47s的程序变成了1.73s。
【注意一】把函数ok改成了define。
【注意二】如果p*p+q*q小于ans,就没必要进行判断了,所以可以预先判断(关键)
【注意三】加上一些神奇的东西可以使第四重循环减少一半。
【注意四】倒着枚举第二个点。
【结果】poj上1391ms过了。
【代码】
#include<cstdio>#include<algorithm>char map[201][201],enter;int n,i,j,x,y,p,q,ans;using namespace std;int main(){ scanf("%d",&n); for (i=1;i<=n;i++) { scanf("%c",&enter); for (j=1;j<=n;j++) scanf("%c",&map[i][j]); } for (x=1;x<=n;x++) for (y=1;y<=n;y++) if (map[x][y]!='B') for (i=n;i>=1;i--) for(j=n;j>=y;j--) {p=i-x;q=j-y;if (p*p+q*q<=ans) continue; if (map[i][j]=='B'||((map[i][j]==map[x][y])&&(map[x][y]!='J'))) continue; #define ok(a,b,c,d) (a>=0&&b>=0&&c>=0&&d>=0) if (ok(x-q,i-q,y+p,j+p)&&(map[x-q][y+p]=='J')&&(map[i-q][j+p]=='J')||ok(y-p,j-p,i+q,x+q)&&(map[x+q][y-p]=='J')&&(map[i+q][j-p]=='J')) ans=p*p+q*q; } printf("%d",ans); return 0;}
- poj3251 & usaco 月赛 2006 Big Square 题解
- POJ3251:Big Square 题解
- POJ3251-Big Square (C语言实现)
- USACO月赛题解 第三讲 排序
- USACO月赛题解 第四讲 贪心
- usaco 2002 月赛 Fiber Communications 题解
- usaco 2002 月赛 Chores 题解
- usaco 月赛 2007 Cow Traffic 题解
- USACO月赛题解整理-集训Day2
- [usaco]5.4.5 Big Barn题解
- usaco training 5.3.4 Big Barn 题解
- USACO月赛题解 第四讲 数值计算
- USACO月赛题解 第三十讲 动态规划(一)
- usaco 2008 月赛 lites 开关灯 题解
- usaco 月赛 2008 February Eating Together 题解
- usaco 2003 月赛 Best Cow Fences & poj2018 题解
- poj 2227 & usaco 2005 月赛 The Wedding Juicer 题解
- bzoj 1600 & Usaco 月赛 2008 建造栅栏 题解
- html块级元素与行内元素-哪些是块级哪些是内联对象
- 求助:php 用windows COM组件调用openoffice接口实现word转pdf文件报错
- ALAsset类
- HDU 1518
- Netty多线程处理机制
- poj3251 & usaco 月赛 2006 Big Square 题解
- Android ViewSwitcher组件
- linux下为php一键安装mysqli扩展
- c++函数适配器(1)——binder1st和binder2nd
- 黑马程序员——Java学习笔记之11——“Collection集合”总结
- iPhone利用MD5加密代码
- 总结一下数据存储加密的过程
- 调试问题汇总
- 三维球动画程序