第三大的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	12ms	6.7 MiB	C++98	273 Bytes	2024-7-13 14:38:51
AC	在线销售陈杰晟	12ms	384 KiB		583 Bytes	2022-5-21 10:15:10
AC	Zongzi1	12ms	6.6 MiB	C++17(O2)	371 Bytes	2024-7-27 18:45:51
AC	tongxiao	12ms	6.9 MiB	C++20(O2)	381 Bytes	2024-6-10 20:18:35
AC	赵鑫宸 (xiaoxiao721)	12ms	384 KiB		537 Bytes	2022-3-26 16:00:49
AC	胡宸华 (huchenhua)	13ms	6.8 MiB		289 Bytes	2023-10-3 16:51:23
AC	yang	13ms	384 KiB		422 Bytes	2022-8-31 13:17:30
AC	疯神芭芭脱丝 (李卓修)	13ms	384 KiB		572 Bytes	2022-7-15 19:16:19
AC	无尽的想象 (谭仕高)	13ms	7.1 MiB	C++11	373 Bytes	2024-4-24 11:06:10
AC	赵泳鑫 (zhaoyongxin)	13ms	512 KiB		605 Bytes	2022-7-17 10:40:06
AC	zlx (xiao)	14ms	448 KiB		330 Bytes	2022-11-26 19:34:11
AC	1396013295	14ms	384 KiB		402 Bytes	2022-1-23 18:52:21
AC	zhangyh (张育菡)	14ms	384 KiB		382 Bytes	2022-9-16 21:21:54
AC	Tender. (05c05-zhou)	14ms	504 KiB		407 Bytes	2022-10-22 23:46:28
AC	陈雨泽1	14ms	416 KiB		375 Bytes	2023-6-3 10:16:40
AC	周靖淞 (zhoujingsong)	14ms	6.9 MiB	C++98(O2)	382 Bytes	2024-8-21 14:26:41
AC	黄梓轩 (huangzixuan)	14ms	6.7 MiB		430 Bytes	2023-9-17 14:04:19
AC	Mr.zou(邹镇宇小号)	14ms	6.9 MiB		391 Bytes	2023-6-29 19:22:05
AC	姚宏逸	14ms	436 KiB		324 Bytes	2022-6-2 22:58:43
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)	15ms	6.8 MiB		392 Bytes	2023-6-24 9:45:01
AC	RanHao	15ms	6.9 MiB		297 Bytes	2023-8-8 16:12:19
AC	huanglu	16ms	420 KiB		406 Bytes	2023-1-13 17:25:21
AC	朱老师 (zyp)	17ms	424 KiB		362 Bytes	2022-9-29 1:21:20
AC	张泰凌 (ztl)	18ms	392 KiB		451 Bytes	2022-5-21 10:17:57
AC	李哲 (lizhe)	18ms	384 KiB		408 Bytes	2022-9-26 20:02:02
AC	杨坤霖 (steven)	22ms	704 KiB		408 Bytes	2023-3-2 19:46:41
AC	王晨志 (wangchenzhi)	23ms	444 KiB		484 Bytes	2022-7-22 19:14:54
AC	杨坤霖 (steven)	23ms	700 KiB		408 Bytes	2023-3-2 19:46:50
AC	新一街校区Jason_LuoYouZheng (罗友峥)	26ms	392 KiB		522 Bytes	2022-5-21 10:22:01
AC	新一街校区Jason_LuoYouZheng (罗友峥)	26ms	404 KiB		522 Bytes	2022-5-21 10:31:58
AC	陈杰晟	27ms	384 KiB		496 Bytes	2022-5-21 10:31:49
AC	新一街校区Jason_LuoYouZheng (罗友峥)	27ms	436 KiB		522 Bytes	2022-5-21 10:31:58
AC	Tang	27ms	392 KiB		486 Bytes	2022-5-21 10:20:32
AC	新一街校区Jason_LuoYouZheng (罗友峥)	27ms	444 KiB		522 Bytes	2022-5-21 10:31:58
AC	冒牌陈杰晟【MOD】 (wed)	28ms	440 KiB		320 Bytes	2022-3-15 19:45:05
AC	贾璨玮 (马NB)	28ms	384 KiB		468 Bytes	2022-5-21 10:20:11
AC	ywh	34ms	424 KiB		385 Bytes	2022-5-21 10:15:23
AC	谢博文	34ms	436 KiB		464 Bytes	2022-5-21 10:18:25
AC	坤坤荔枝小黑子 (zhonghaotian22006)	44ms	428 KiB		594 Bytes	2022-11-3 21:26:16
AC	朱老师 (zyp)	54ms	532 KiB		342 Bytes	2024-2-2 15:45:48
AC	zyl	59ms	760 KiB		334 Bytes	2024-2-2 14:12:35
AC	zhy123	59ms	532 KiB		286 Bytes	2024-2-2 15:51:20
AC	cj66	62ms	532 KiB	C++11(O2)	269 Bytes	2024-9-19 21:17:05
AC	juyuxuan	62ms	764 KiB		304 Bytes	2024-2-2 15:48:00
AC	WJF (王健沣23017)	65ms	772 KiB		347 Bytes	2024-2-2 15:51:50
AC	scallway	66ms	812 KiB		333 Bytes	2024-3-19 11:47:39
AC	jdy	92ms	548 KiB		369 Bytes	2024-3-10 14:23:34
AC	汪致卉 (wangzh)	173ms	4 MiB	Python 3	191 Bytes	2022-4-22 16:49:16