本文共 1837 字，大约阅读时间需要 6 分钟。
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#pragma GCC optimize(2)using namespace std;#define maxn 100005#define inf 0x7fffffff//#define INF 1e18#define rdint(x) scanf("%d",&x)#define rdllt(x) scanf("%lld",&x)#define rdult(x) scanf("%lu",&x)#define rdlf(x) scanf("%lf",&x)#define rdstr(x) scanf("%s",x)typedef long long ll;typedef unsigned long long ull;typedef unsigned int U;#define ms(x) memset((x),0,sizeof(x))const long long int mod = 1e9 + 7;#define Mod 1000000000#define sq(x) (x)*(x)#define eps 1e-4typedef pair pii;#define pi acos(-1.0)//const int N = 1005;#define REP(i,n) for(int i=0;i<(n);i++)typedef pair pii;inline ll rd() { ll x = 0; char c = getchar(); bool f = false; while (!isdigit(c)) { if (c == '-') f = true; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return f ? -x : x;}ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a%b);}int sqr(int x) { return x * x; }/*ll ans;ll exgcd(ll a, ll b, ll &x, ll &y) { if (!b) { x = 1; y = 0; return a; } ans = exgcd(b, a%b, x, y); ll t = x; x = y; y = t - a / b * y; return ans;}*/priority_queue q;priority_queue q2;int main() { //ios::sync_with_stdio(0); int n; rdint(n); for (int i = 1; i <= n; i++) { char op; cin >> op; if (op == '+') { int x, y; rdint(x); rdint(y); if (x > y)swap(x, y); q.push(x); q2.push(y); } else { int u, w; rdint(u); rdint(w); bool fg = false; if (q.top() <= u && q2.top() <= w)fg = true; if (q.top() <= w && q2.top() <= u)fg = true; if (fg) { cout << "YES" << endl; } else cout << "NO" << endl; } } return 0;}
转载于:https://www.cnblogs.com/zxyqzy/p/10275710.html
