A题 给出不多于四个点,判断是否构成矩形,要求矩形的边与坐标轴平行。 没有想出好方法,但是觉得数据很小,于是暴力枚举出所有的可能情况,进行判断,比赛的时候判断错了一个条件,后来改对了。
#include
#include
#include
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n==1)
{
int x1,y1;
scanf("%d%d",&x1,&y1);
printf("-1\n");
}
if(n==2)
{
int s=0;
int x1,y1,x2,y2;
scanf("%d%d",&x1,&y1);
scanf("%d%d",&x2,&y2);
if(x1==x2||y1==y2) printf("-1\n");
else
{
s=abs(x1-x2)*abs(y1-y2);
printf("%d\n",s);
}
}
if(n==3)
{
int s=0;
int x1,y1,x2,y2,x3,y3;
scanf("%d%d",&x1,&y1);
scanf("%d%d",&x2,&y2);
scanf("%d%d",&x3,&y3);
if(x1==x3&&y1==y2) {s=abs(x1-x3)*abs(y1-y2);printf("%d\n",s);}
else if(x1==x2&&y1==y3) {s=abs(x1-x3)*abs(y1-y2);printf("%d\n",s);}
else if(x2==x3&&y2==y1) {s=abs(x2-x1)*abs(y3-y2);printf("%d\n",s);}
else if(x2==x1&&y2==y3) {s=abs(x3-x2)*abs(y1-y2);printf("%d\n",s);}
else if(x3==x1&&y3==y2) {s=abs(x2-x3)*abs(y3-y1);printf("%d\n",s);}
else if(x3==x2&&y3==y1) {s=abs(x1-x3)*abs(y2-y3);printf("%d\n",s);}
else printf("-1\n");
}
if(n==4)
{
int s=0;
int x1,y1,x2,y2,x3,y3,x4,y4;
scanf("%d%d",&x1,&y1);
scanf("%d%d",&x2,&y2);
scanf("%d%d",&x3,&y3);
scanf("%d%d",&x4,&y4);
if(x1==x3&&x2==x4&&y1==y2&&y3==y4){s=abs(x1-x4)*abs(y1-y3);printf("%d\n",s);}
else if(x1==x3&&x2==x4&&y1==y4&&y3==y2){s=abs(x1-x4)*abs(y1-y3);printf("%d\n",s);}
else if(x1==x2&&x3==x4&&y1==y3&&y2==y4){s=abs(x1-x3)*abs(y1-y2);printf("%d\n",s);}
else if(x1==x2&&x3==x4&&y1==y4&&y3==y2){s=abs(x1-x3)*abs(y1-y2);printf("%d\n",s);}
else if(x1==x4&&x2==x3&&y1==y3&&y2==y4){s=abs(x1-x3)*abs(y4-y1);printf("%d\n",s);}
else if(x1==x4&&x2==x3&&y1==y2&&y3==y4){s=abs(x1-x3)*abs(y1-y4);printf("%d\n",s);}
else printf("-1\n");
}
return 0;
}
B题 貌似以前做过类似的,给出一组初始化为零的数组,每次从第i个数向后进行加一或减一的操作,问最少经过几次能得到给出的数列。总之还算很简单,开始数据没考虑,改成long long就好了
#include
#include
#include
#include
using namespace std;
int main()
{
int n,maxx=0,index=0;
int a[200005];
memset(a,0,sizeof(a));
scanf("%d",&n);
for(int i=0;i
C题 没做出来,时间不够了,后来补的。是个贪心问题,还算可以,前面两道浪费时间太多了。继续努力吧。
我看大神都在用stl,看来得学习学习。