CodeVs 1134 && noip 2011 Day1 铺地毯

/*
暴力的写法基本2-3分钟就能想到的做法，轻松水到50分
*/
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cstdlib>
using namespace std;
const int M=1005;
int map[M][M];
void solve(int sx, int st, int x, int y, int color)
{

for (int i=0; i<=x; i++)
for (int j=0; j<=y; j++)
map[sx+i][st+j]=color;
}
int main()
{
int n;
cin>>n;
memset(map, -1, sizeof(map));
for (int i=1; i<=n; i++)
{
int a, b, g, k;
cin>>a>>b>>g>>k;
solve(a, b, g, k, i);
}
int x, y;
cin>>x>>y;
cout<<map[x][y]<<endl;
return 0;
}

/*
倒过来看一下就知道了，如果点在范围内可以直接输出，第一题一般都是模拟题，只要细心想一下ac不是很难的事
*/

#include<iostream>
#include<cstdlib>
#include<cstring>
using namespace std;
const int M=100005;
int ans;
int n;
int x1[M];
int y1[M];
int x2[M];
int y2[M];
int main()
{
cin>>n;
int nn=n;
int j=0;
while (n--)
{
int a, b, g, k;
cin>>a>>b>>g>>k;
x1[++j]=a;
x2[j]=a+g;
y1[j]=b;
y2[j]=b+k;
}
int x, y;
ans=-1;
cin>>x>>y;
for (int i=nn; i>=1; i--)
{
if (x>=x1[i] && y>=y1[i] && x<=x2[i] && y<=y2[i]){
ans=i;
break;
}
}
cout<<ans<<endl;
return 0;
}