摘要:
#include #define maxn 500005 //#define int long long using namespace std; inline int read() { char x = getchar(); int lin = 0, f = 1; while(x '9') { if(x == '-') f = -1; ... 阅读全文
摘要:
#include #define maxn 500005 #define int long long using namespace std; inline int read() { char x = getchar(); int lin = 0, f = 1; while(x '9') { if(x == '-') f = -1; ... 阅读全文
摘要:
#include #define maxn 500005 //#define int long long using namespace std; inline int read() { char x = getchar(); int lin = 0, f = 1; while(x '9') { if(x == '-') f = -1; ... 阅读全文
摘要:
// luogu-judger-enable-o2 #include #define maxn 1000002 //#define int long long //#define kcz using namespace std; inline int read() { char x = getchar(); int lin = 0,f = 1; while(x '9')... 阅读全文
摘要:
导弹防御 题目描述: Country A 与 B 是敌对国家,它们正在一场战争中互相发射导弹。A 国共发射了 N 枚导弹,其中第 i 枚的发射时间为 Ta_i,花费 Tac_i 的时间飞到 B 国,并可对 B 国造成 Da_i 点损害。 .B 国共发射了 M 枚导弹,其中第 i 枚的发射时间为 Tb 阅读全文
摘要:
Magic boy Bi Luo with his excited tree Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1505 Acc 阅读全文