我的思路是:本题即判断该点被覆盖了几次,若为0则输出1

P1003 [NOIP2011 提高组] 铺地毯

但为什么只有20分
by OI_lover @ 2018-08-07 09:06:13


哦,我知道哪错了,并不是有几个就是第几个铺在上面,谢谢
by OI_lover @ 2018-08-07 09:09:28


但为什么这个又是错的 ``` #include<iostream> #include<cstdio> using namespace std; #define N 10050 struct range { int a; int b; int lx; int ly; } p[N]; int x,y; bool isin(int a,int b,int lx,int ly){ if(x>=a && x<=a+lx && y<=b && y>=b-ly+1) return true; return false; } int n; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d%d%d%d",&p[i].a,&p[i].b,&p[i].lx,&p[i].ly); scanf("%d%d",&x,&y); int i=n; for(i=n;i>=1;i--) if(isin(p[i].a,p[i].b,p[i].lx,p[i].ly)){ printf("%d",i+1); return 0; } printf("%d",-1); return 0; } ```
by OI_lover @ 2018-08-07 09:21:17


哦,我知道了,打错了,谢谢
by OI_lover @ 2018-08-07 09:30:54



by l156565285 @ 2018-08-10 18:00:28



by wxy_god @ 2018-08-16 21:31:30



by Sai0511 @ 2018-08-22 19:43:03


|