请问怎样简化二维数组

P1003 [NOIP2011 提高组] 铺地毯

然而这道题用不到二维。。。 代码如下(自己写的,请勿copy) ```cpp #include<iostream> #include<cstring> #include<cstdlib> #include<cstdio> using namespace std; int a[100001],b[100001],l1[100001],l2[100001]; int main() { int i,n,x,y; freopen("carpet10.in","r",stdin); freopen("carpet10.out","w",stdout); scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d%d%d%d",&a[i],&b[i],&l1[i],&l2[i]); scanf("%d%d",&x,&y); for(i=n;i>=1;i--) if(x>=a[i] && x<=a[i]+l1[i] && y>=b[i] && y<=b[i]+l2[i]) { printf("%d",i); break; } if(i==0) printf("-1"); return 0; } ```
by andyc_03 @ 2017-10-08 10:39:56


还有二维数组开到5000\*5000正常是不会炸的
by andyc_03 @ 2017-10-08 10:40:40


上一页 |