输出a、b、c中的最大值

状态	递交者	时间	内存	代码	递交时间
AC	05c05-hzy	28ms	432 KiB	199 Bytes	2023-3-5 10:02:50
AC	朱泽晟	28ms	384 KiB	251 Bytes	2022-2-12 20:40:12
AC	贾鑫豪 (Mr Sam)	28ms	384 KiB	234 Bytes	2022-2-19 14:25:51
AC	源著校区-宋昊成 (马冬梅)	28ms	436 KiB	275 Bytes	2023-2-25 18:07:23
AC	强者 (hhy)	28ms	440 KiB	146 Bytes	2023-5-7 10:30:00
AC	星野光 (Hoshino Hikari)	28ms	6.8 MiB	186 Bytes	2023-10-22 21:53:43
AC	luojunyang	28ms	440 KiB	239 Bytes	2022-1-20 20:16:34
AC	缥 (王硕2012)	28ms	396 KiB	314 Bytes	2022-10-16 9:40:11
AC	wuzhenghan	28ms	440 KiB	182 Bytes	2023-2-3 14:59:52
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	28ms	384 KiB	236 Bytes	2023-3-5 10:36:35
AC	钟京润	28ms	396 KiB	296 Bytes	2022-9-3 16:05:31
AC	张梓辰 (DiaoDesi屌德斯)	28ms	512 KiB	272 Bytes	2022-7-19 8:47:49
AC	zhangheyi22006	28ms	6.7 MiB	184 Bytes	2023-9-10 10:32:19
AC	刘煜轩	28ms	440 KiB	219 Bytes	2023-5-10 21:43:26
AC	叶哲宇 (yzy)	28ms	7.1 MiB	135 Bytes	2023-8-22 17:17:53
AC	xxteacher	28ms	412 KiB	361 Bytes	2022-2-8 15:23:50
AC	李山水	28ms	444 KiB	278 Bytes	2022-2-23 19:52:34
AC	杨瀚霖 (yanghanlin)	28ms	440 KiB	203 Bytes	2023-2-20 22:20:47
AC	曹元明	28ms	384 KiB	152 Bytes	2022-9-3 13:08:25
AC	05c41-hzs	28ms	440 KiB	264 Bytes	2022-3-16 18:34:14
AC	22029-lyh	28ms	384 KiB	190 Bytes	2022-12-2 15:39:09
AC	肖添宇	28ms	512 KiB	224 Bytes	2022-3-12 17:57:17
AC	wangmulai	28ms	512 KiB	217 Bytes	2023-5-13 9:31:44
AC	Him神	29ms	6.9 MiB	226 Bytes	2023-11-19 22:00:42
AC	文硕 (文硕1)	29ms	512 KiB	197 Bytes	2022-2-6 13:45:32
AC	蒲梓勋 (puzixun)	29ms	448 KiB	249 Bytes	2022-7-15 19:38:18
AC	凌肯 (lingken22006)	29ms	444 KiB	230 Bytes	2022-7-31 18:58:50
AC	叶雨昊 (yeyuhao22006)	29ms	512 KiB	276 Bytes	2022-8-15 20:17:46
AC	zhangyouze (张佑泽)	29ms	6.9 MiB	194 Bytes	2023-10-21 18:18:24
AC	伍芷函	29ms	512 KiB	257 Bytes	2022-9-11 17:33:02
AC	童艺涵	29ms	436 KiB	232 Bytes	2022-11-29 21:33:45
AC	huanglu	29ms	7.1 MiB	184 Bytes	2023-7-15 16:04:23
AC	liusitong	29ms	512 KiB	177 Bytes	2023-5-2 17:38:11
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	29ms	512 KiB	224 Bytes	2022-8-9 21:15:15
AC	ganlin1	29ms	6.9 MiB	118 Bytes	2023-7-15 15:40:39
AC	时代一校-赵彦博 (zyb)	29ms	392 KiB	182 Bytes	2022-10-23 12:11:10
AC	李旻轩	29ms	384 KiB	308 Bytes	2023-4-8 9:17:48
AC	chenyifei	29ms	436 KiB	234 Bytes	2022-2-19 20:16:53
AC	一片落叶 (yeyuhao)	29ms	6.7 MiB	249 Bytes	2023-8-28 20:20:24
AC	时代2校-程俊燃 (chengjunran)	29ms	512 KiB	177 Bytes	2023-4-19 18:43:17
AC	铁牛杰哥官方频道	29ms	436 KiB	203 Bytes	2022-3-9 20:08:27
AC	新壹街校区-陈琬舒 (空空大师)	29ms	6.8 MiB	127 Bytes	2023-10-15 21:03:42
AC	时代一校 - 冯隆浩 (冯隆浩)	29ms	512 KiB	180 Bytes	2022-4-16 19:03:22
AC	11451254188 (22029-mjh)	29ms	384 KiB	194 Bytes	2022-11-30 13:28:36
AC	黄梓轩 (huangzixuan)	29ms	6.9 MiB	231 Bytes	2023-7-16 14:11:39
AC	22029-zjs	29ms	384 KiB	172 Bytes	2023-3-25 11:24:29
AC	无尽的想象 (谭仕高)	29ms	384 KiB	350 Bytes	2022-11-23 11:23:45
AC	肖添宇	29ms	512 KiB	210 Bytes	2022-7-1 11:56:53
AC	曹埊睿 (caodirui)	29ms	512 KiB	127 Bytes	2023-4-15 20:01:36
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	29ms	392 KiB	236 Bytes	2023-3-5 10:36:36
AC	新壹街-王俊博 (王俊博)	29ms	6.9 MiB	154 Bytes	2023-7-10 15:37:44
AC	cupy战士 (05c05-dkf)	29ms	6.9 MiB	204 Bytes	2023-9-24 11:33:50
AC	22029-lsl	30ms	6.8 MiB	196 Bytes	2023-6-17 9:24:14
AC	况奕辛 (KYX_yyds)	30ms	448 KiB	155 Bytes	2022-2-18 18:57:42
AC	陈风亦 (chenfengyi)	30ms	384 KiB	194 Bytes	2022-9-10 12:36:01
AC	无尽的想象 (谭仕高)	30ms	392 KiB	307 Bytes	2022-11-23 11:22:33
AC	周米骐 (zsb)	30ms	6.7 MiB	181 Bytes	2023-8-27 12:56:22
AC	x0l0x	30ms	6.8 MiB	132 Bytes	2023-10-2 17:52:57
AC	22029-zjs	30ms	384 KiB	184 Bytes	2023-3-25 11:21:45
AC	56 (13883454928)	30ms	6.7 MiB	193 Bytes	2023-8-30 10:53:35
AC	Nico	30ms	440 KiB	194 Bytes	2023-4-16 14:37:05
AC	月下的九尾银狐	30ms	384 KiB	172 Bytes	2023-1-10 11:27:57
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)	30ms	444 KiB	198 Bytes	2023-5-15 18:52:47
AC	希蒙 (zhengxingya)	30ms	6.9 MiB	301 Bytes	2023-7-25 16:27:55
AC	周琪渃	30ms	384 KiB	337 Bytes	2022-11-24 18:28:27
AC	Error404sans (焦阳浩云)	30ms	7.3 MiB	165 Bytes	2023-7-12 16:53:07
AC	时代1校-杨宇轩 (杨宇轩)	30ms	384 KiB	198 Bytes	2023-1-10 11:23:46
AC	张峻熙	30ms	436 KiB	213 Bytes	2022-10-31 20:32:19
AC	时代一校黄誉翔 (huang)	30ms	512 KiB	120 Bytes	2022-10-22 17:21:30
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	30ms	512 KiB	205 Bytes	2022-11-28 8:24:06
AC	时代二校-焦雨齐 (Angel)	30ms	6.9 MiB	167 Bytes	2023-7-22 17:07:57
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	30ms	392 KiB	236 Bytes	2023-3-5 10:36:35
AC	李林峰 (金克拉)	30ms	436 KiB	213 Bytes	2023-2-18 8:56:02
AC	yanglang	30ms	440 KiB	127 Bytes	2022-10-21 23:28:04
AC	牟淳雅	30ms	6.8 MiB	224 Bytes	2023-9-24 11:02:57
AC	谭懿轩 (yanyixuan)	30ms	540 KiB	189 Bytes	2022-2-15 14:20:20
AC	杨皓宇 (杨浩宇)	30ms	384 KiB	237 Bytes	2022-11-19 11:17:45
AC	dengduxi	30ms	512 KiB	391 Bytes	2022-11-13 14:09:22
AC	朱老师 (zyp)	30ms	444 KiB	143 Bytes	2022-7-28 11:16:42
AC	zzzrrrxxx	31ms	6.9 MiB	153 Bytes	2023-7-16 14:23:14
AC	呵呵呵 (陈思琦)	31ms	392 KiB	179 Bytes	2022-12-24 15:23:21
AC	Tender. (05c05-zhou)	31ms	512 KiB	285 Bytes	2022-10-17 20:28:26
AC	李哲 (lizhe)	31ms	512 KiB	422 Bytes	2022-11-8 19:21:53
AC	Yin2009	31ms	440 KiB	184 Bytes	2022-10-23 12:07:58
AC	新壹街校区-郭老师-陈品烨 (陈品烨)	31ms	6.8 MiB	226 Bytes	2023-10-2 14:40:13
AC	chaikexu	31ms	512 KiB	171 Bytes	2022-11-18 21:17:57
AC	章愉霖	31ms	520 KiB	296 Bytes	2023-6-1 11:03:16
AC	zhangshihan	31ms	384 KiB	202 Bytes	2023-1-10 11:25:29
AC	胡宸华 (huchenhua)	31ms	512 KiB	129 Bytes	2022-11-5 23:42:02
AC	黄立信	31ms	6.9 MiB	128 Bytes	2023-8-18 15:11:46
AC	tyx_9192596	31ms	436 KiB	161 Bytes	2023-3-17 18:36:05
AC	关博源	31ms	512 KiB	140 Bytes	2023-3-11 9:20:32
AC	游智棋	31ms	7.1 MiB	209 Bytes	2023-7-18 11:44:52
AC	邬文博 (wwb)	31ms	440 KiB	142 Bytes	2023-5-29 20:39:55
AC	李龙腾 (llt)	31ms	7.2 MiB	251 Bytes	2023-6-29 20:49:09
AC	繁星 (05c35-zzm)	31ms	512 KiB	141 Bytes	2022-10-23 9:31:34
AC	罗伟杰 (13308275065)	31ms	512 KiB	130 Bytes	2022-8-30 15:11:27
AC	杜是贤 (dushixian)	31ms	440 KiB	127 Bytes	2022-11-26 11:11:19
AC	chenjunyao	31ms	6.9 MiB	209 Bytes	2023-8-20 17:43:46
AC	黄梓桐 (HuangZiTong)	31ms	436 KiB	123 Bytes	2023-2-1 13:44:34