A题，看样例就知道要求什么， 水过去
1 #include <stdio.h> 2 #include <string.h> 3 #include <stdlib.h> 4 #include <algorithm> 5 #include <iostream> 6 #include <queue> 7 #include <stack> 8 #include <vector> 9 #include <map> 10 #include <set> 11 #include <string> 12 #include <math.h> 13 using namespace std; 14 #pragma warning(disable:4996) 15 typedef long long LL; 16 const int INF = 1<<30; 17 /* 18 19 */ 20 int vis[101][101]; 21 int main() 22 { 23 int n, a, b, c, d; 24 scanf("%d", &n); 25 for (int i = 1; i <= n; ++i) 26 { 27 scanf("%d%d%d%d", &a, &b, &c, &d); 28 for (int j = a; j <= c; ++j) 29 for (int k = b; k <= d; ++k) 30 vis[j][k]++; 31 } 32 int ans = 0; 33 for (int i = 1; i <= 100; ++i) 34 for (int j = 1; j <= 100; ++j) 35 if (vis[i][j]) 36 ans += vis[i][j]; 37 printf("%d\n", ans); 38 return 0; 39 }