最大值和最小值的差

状态	递交者	时间	内存	代码	递交时间
AC	龚铭俊 (哈哈哈)	55ms	6.9 MiB	244 Bytes	2023-7-23 13:43:46
AC	繁星 (05c35-zzm)	55ms	384 KiB	252 Bytes	2022-9-11 9:36:21
AC	繁星 (05c35-zzm)	55ms	384 KiB	252 Bytes	2022-9-11 9:36:20
AC	huyunyi23003	55ms	384 KiB	209 Bytes	2023-6-1 19:59:54
AC	pandap&a王皓宸 (WANGHAOCHEN)	55ms	392 KiB	311 Bytes	2022-12-28 14:45:41
AC	繁星 (05c35-zzm)	55ms	384 KiB	252 Bytes	2022-9-11 9:26:04
AC	繁星 (05c35-zzm)	55ms	392 KiB	252 Bytes	2022-9-11 9:35:04
AC	杜启苇 (duqiwei)	55ms	576 KiB	312 Bytes	2022-7-26 14:34:02
AC	繁星 (05c35-zzm)	56ms	404 KiB	252 Bytes	2022-9-11 9:35:02
AC	李廷旭 (litingxu)	56ms	456 KiB	226 Bytes	2023-5-7 18:06:52
AC	牟淳雅	56ms	6.9 MiB	267 Bytes	2023-7-26 14:10:03
AC	22029-zjs	56ms	408 KiB	294 Bytes	2022-11-19 11:18:13
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:34:50
AC	赵启程 (赵启程1)	56ms	512 KiB	241 Bytes	2023-3-18 19:59:43
AC	时代2校+涂彦迪 (tuyandi)	56ms	7.1 MiB	272 Bytes	2023-7-18 17:13:07
AC	繁星 (05c35-zzm)	56ms	412 KiB	252 Bytes	2022-9-11 9:36:24
AC	ShenChuan	56ms	6.7 MiB	215 Bytes	2023-9-9 10:35:04
AC	leisixian (22029-lyh)	56ms	392 KiB	315 Bytes	2022-11-19 10:08:39
AC	maobohan	56ms	7.3 MiB	231 Bytes	2023-12-16 10:03:12
AC	陈家齐 (陈家齐1)	56ms	384 KiB	195 Bytes	2023-3-18 20:28:10
AC	汤杰尧 (05c05-tjy1)	56ms	440 KiB	231 Bytes	2023-2-12 16:32:29
AC	时代一校林星宇 (lxy)	56ms	512 KiB	294 Bytes	2023-2-2 19:00:58
AC	胡程禹	56ms	404 KiB	285 Bytes	2023-3-18 20:12:56
AC	科比.布莱恩特 (董浩琰)	56ms	384 KiB	286 Bytes	2023-3-18 20:30:08
AC	陈骏逸 (chenjunyi)	56ms	488 KiB	229 Bytes	2022-8-4 21:48:53
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:26:08
AC	12345	56ms	484 KiB	326 Bytes	2022-8-3 17:01:20
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:36:21
AC	谁陪訫牞（杀手） (22029-zys)	56ms	384 KiB	425 Bytes	2023-1-5 17:30:56
AC	huyinuo	56ms	444 KiB	245 Bytes	2022-2-27 18:00:50
AC	陈廷恩	56ms	6.8 MiB	211 Bytes	2023-10-27 21:04:26
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:35:02
AC	22016-lyj	56ms	436 KiB	252 Bytes	2023-5-7 11:17:38
AC	凌肯 (lingken22006)	56ms	468 KiB	349 Bytes	2022-7-31 21:53:06
AC	曾龙兮	56ms	584 KiB	289 Bytes	2023-2-19 18:11:04
AC	繁星 (05c35-zzm)	56ms	428 KiB	252 Bytes	2022-9-11 9:26:05
AC	胡瀚文	56ms	512 KiB	293 Bytes	2022-7-12 15:57:01
AC	繁星 (05c35-zzm)	56ms	412 KiB	252 Bytes	2022-9-11 9:26:07
AC	新一街校区Jason_LuoYouZheng (罗友峥)	56ms	436 KiB	337 Bytes	2023-5-18 20:26:13
AC	CWj	56ms	552 KiB	354 Bytes	2023-6-1 19:47:08
AC	王晴萱	56ms	7.1 MiB	267 Bytes	2023-7-13 16:37:37
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:34:50
AC	Nico	56ms	448 KiB	259 Bytes	2023-4-16 14:41:35
AC	22016-lyj	56ms	464 KiB	252 Bytes	2023-5-7 11:17:15
AC	Jack	56ms	512 KiB	225 Bytes	2022-8-17 19:11:13
AC	yanglang	56ms	416 KiB	199 Bytes	2022-10-22 20:41:42
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:26:08
AC	江坤锜	56ms	384 KiB	312 Bytes	2023-3-18 20:03:46
AC	吴俊成 (wujuncheng)	56ms	552 KiB	279 Bytes	2022-7-9 22:23:36
AC	繁星 (05c35-zzm)	56ms	512 KiB	252 Bytes	2022-9-11 9:26:03
AC	繁星 (05c35-zzm)	56ms	384 KiB	252 Bytes	2022-9-11 9:35:04
AC	源著校区-宋昊成 (马冬梅)	56ms	568 KiB	420 Bytes	2023-2-25 18:14:28
AC	朱泽晟	56ms	572 KiB	261 Bytes	2022-2-12 21:21:42
AC	繁星 (05c35-zzm)	56ms	432 KiB	252 Bytes	2022-9-11 9:26:07
AC	霍弈丞小号	56ms	468 KiB	259 Bytes	2023-4-9 12:14:13
AC	Tender. (05c05-zhou)	56ms	552 KiB	368 Bytes	2023-3-5 18:30:15
AC	陈红恺 (chk)	56ms	456 KiB	261 Bytes	2022-7-28 15:03:48
AC	laiyouming22031	56ms	444 KiB	212 Bytes	2022-11-27 12:11:40
AC	新壹街校区--税崇峻 (税崇峻)	56ms	6.9 MiB	232 Bytes	2023-8-5 18:46:08
AC	繁星 (05c35-zzm)	56ms	432 KiB	252 Bytes	2022-9-11 9:36:21
AC	繁星 (05c35-zzm)	56ms	420 KiB	252 Bytes	2022-9-11 9:26:08
AC	马渝杭 (mayuhang)	56ms	384 KiB	284 Bytes	2023-3-17 18:44:43
AC	繁星 (05c35-zzm)	56ms	440 KiB	252 Bytes	2022-9-11 9:26:08
AC	张梓辰 (DiaoDesi屌德斯)	57ms	512 KiB	309 Bytes	2022-9-14 19:38:15
AC	繁星 (05c35-zzm)	57ms	392 KiB	252 Bytes	2022-9-11 9:35:02
AC	疯神芭芭脱丝 (李卓修)	57ms	512 KiB	389 Bytes	2022-7-16 13:54:25
AC	马渝杭 (mayuhang)	57ms	384 KiB	304 Bytes	2023-3-17 18:47:38
AC	ttt123	57ms	512 KiB	426 Bytes	2023-1-5 17:22:56
AC	scallway	57ms	452 KiB	305 Bytes	2023-2-26 0:31:33
AC	繁星 (05c35-zzm)	57ms	400 KiB	252 Bytes	2022-9-11 9:36:21
AC	灿灿 (CAN)	57ms	448 KiB	270 Bytes	2022-6-26 14:27:02
AC	繁星 (05c35-zzm)	57ms	420 KiB	252 Bytes	2022-9-11 9:26:06
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	57ms	512 KiB	298 Bytes	2023-1-30 9:40:21
AC	新壹街校区-周士杰 (zsj)	57ms	6.7 MiB	215 Bytes	2023-8-28 9:39:01
AC	苏庭毅	57ms	416 KiB	253 Bytes	2023-3-18 20:16:03
AC	繁星 (05c35-zzm)	57ms	384 KiB	252 Bytes	2022-9-11 9:26:08
AC	希蒙 (zhengxingya)	57ms	6.7 MiB	314 Bytes	2023-8-22 16:17:40
AC	钟京润	57ms	412 KiB	233 Bytes	2022-11-27 13:17:01
AC	李某人	57ms	512 KiB	280 Bytes	2022-2-11 14:58:42
AC	繁星 (05c35-zzm)	57ms	392 KiB	252 Bytes	2022-9-11 9:36:22
AC	坤坤荔枝小黑子 (zhonghaotian22006)	57ms	476 KiB	368 Bytes	2023-2-20 20:33:13
AC	linjingming	57ms	512 KiB	233 Bytes	2022-8-16 16:58:09
AC	时代二校-焦雨齐 (Angel)	57ms	448 KiB	197 Bytes	2023-4-16 13:54:28
AC	贾鑫豪 (Mr Sam)	57ms	464 KiB	355 Bytes	2022-3-3 6:42:42
AC	孙天豪 (AliceSteven)	57ms	464 KiB	299 Bytes	2022-7-27 17:04:47
AC	yaokaixuan	57ms	568 KiB	350 Bytes	2022-2-16 19:18:11
AC	繁星 (05c35-zzm)	57ms	416 KiB	252 Bytes	2022-9-11 9:35:00
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	57ms	452 KiB	299 Bytes	2022-11-13 16:43:49
AC	缥 (王硕2012)	57ms	512 KiB	319 Bytes	2022-11-28 22:05:03
AC	陈杰晟	57ms	520 KiB	412 Bytes	2022-2-19 10:54:59
AC	韦孟巡_1	57ms	456 KiB	472 Bytes	2023-4-9 17:25:13
AC	繁星 (05c35-zzm)	57ms	392 KiB	252 Bytes	2022-9-11 9:36:23
AC	邹曜丞 (13983097018)	57ms	456 KiB	231 Bytes	2023-5-6 21:00:55
AC	谁陪訫牞（杀手） (22029-zys)	57ms	384 KiB	425 Bytes	2023-1-5 17:31:00
AC	李清城 (朱瀚文集训号)	57ms	512 KiB	315 Bytes	2023-2-2 17:16:46
AC	时代2校-程俊燃 (chengjunran)	57ms	512 KiB	305 Bytes	2023-4-8 20:35:45
AC	AC[谭赫奕] (tanheyi)	57ms	384 KiB	236 Bytes	2023-4-1 11:28:42
AC	Guest	57ms	7 MiB	260 Bytes	2023-11-25 11:29:54
AC	yuhaodi	57ms	468 KiB	492 Bytes	2023-4-24 18:43:47
AC	程子杰 (05c41-czj)	58ms	456 KiB	272 Bytes	2022-7-27 10:40:23