【蓝桥杯省赛】最大值

状态	递交者	时间	内存	语言	代码	递交时间
AC	新壹街-曾浩坤 (曾浩坤)	13ms	6.9 MiB	C++98	495 Bytes	2024-8-21 16:52:12
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	7.1 MiB	C++98	603 Bytes	2024-5-19 11:52:07
AC	吕同学是傻逼 (黄立信)	14ms	6.9 MiB	C++98	729 Bytes	2024-8-21 16:47:00
AC	11451254188 (22029-mjh)	14ms	7.2 MiB	C++98(O2)	465 Bytes	2024-5-19 11:54:00
AC	朱老师 (zyp)	14ms	7.1 MiB	C++11	635 Bytes	2024-5-19 11:52:12
AC	张瑞博	14ms	7.1 MiB	C++11	502 Bytes	2024-5-19 12:25:52
AC	Tsunami (丁宇平)	14ms	7.1 MiB	C++98	452 Bytes	2024-5-19 11:52:28
AC	新壹街校区-周士杰 (zsj)	14ms	7 MiB	C++98	345 Bytes	2024-8-24 17:16:50
AC	张子扬	14ms	384 KiB		494 Bytes	2023-5-13 17:20:46
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)	14ms	7.1 MiB	C++11	543 Bytes	2024-5-19 11:55:05
AC	梦之泪伤	14ms	392 KiB		400 Bytes	2023-5-13 22:09:38
AC	黄立信是XXS (吕同学)	14ms	7 MiB	C++14(O2)	904 Bytes	2024-8-23 17:35:59
AC	SB2	14ms	6.9 MiB	C++98(O2)	781 Bytes	2024-8-21 18:01:22
AC	6 (chenjiacheng)	14ms	7.1 MiB	C++98	502 Bytes	2024-5-19 11:52:40
AC	新壹街——陈学彬 (BUG)	14ms	7 MiB	C++98	484 Bytes	2024-8-25 13:01:58
AC	张子扬	14ms	384 KiB		494 Bytes	2023-5-13 17:19:46
AC	heyi	14ms	6.9 MiB	C++98(O2)	692 Bytes	2024-8-18 11:57:47
AC	朱老师 (zyp)	15ms	7.2 MiB	C++11	517 Bytes	2024-5-8 15:24:47
AC	huanglu	15ms	7.2 MiB	C++98	374 Bytes	2024-5-10 13:33:22
AC	李泽杨	15ms	7 MiB	C++98	524 Bytes	2024-8-24 16:36:12
AC	何昊宇 (22016-hhy)	15ms	7.1 MiB	C++98	410 Bytes	2024-5-19 11:57:36
AC	新壹街校区-陈品烨 (陈品烨)	15ms	7.2 MiB	C++98	435 Bytes	2024-8-25 11:04:13
AC	小忙果 (王昱杰)	16ms	7 MiB	C++98	348 Bytes	2024-8-24 16:56:06
AC	经常消失 (小萝卜)	16ms	392 KiB		601 Bytes	2023-5-14 9:35:29
AC	zyp (wangjunling23010)	21ms	6.9 MiB	C++11	330 Bytes	2024-8-22 10:49:09
AC	zhuxiayu	21ms	6.9 MiB	C++11	371 Bytes	2024-8-22 10:47:40
AC	邓皓天 (1234567A)	22ms	6.7 MiB	C++98	404 Bytes	2024-8-3 12:04:48
AC	heyi	22ms	6.9 MiB	C++98(O2)	582 Bytes	2024-8-18 11:55:37
AC	刘老师 (图书管理员)	22ms	6.9 MiB	C++11	616 Bytes	2024-8-18 11:53:39
AC	坤坤荔枝小黑子 (zhonghaotian22006)	22ms	6.9 MiB	C++11	374 Bytes	2024-8-22 10:44:52
AC	zcx	22ms	6.9 MiB	C++98	352 Bytes	2024-8-22 10:42:34
AC	zhongjunxuan	23ms	6.9 MiB	C++11	320 Bytes	2024-8-22 10:48:32
AC	朱老师 (zyp)	23ms	6.9 MiB	C++11	448 Bytes	2024-8-22 10:42:17
AC	田雨杨 (tianyuyang23010)	24ms	6.9 MiB	C++98	395 Bytes	2024-8-22 10:44:19
AC	邓皓天 (1234567A)	24ms	6.7 MiB	C++98	404 Bytes	2024-8-3 12:04:40
AC	曹雅萱	25ms	6.9 MiB	C++11	367 Bytes	2024-8-21 15:47:43
AC	胡唯轶	25ms	6.9 MiB	C++11	395 Bytes	2024-8-22 10:44:41
AC	鲜榨大肠汁	52ms	6.9 MiB	C++98	380 Bytes	2024-8-21 16:51:25
AC	鲜榨大肠汁	52ms	6.9 MiB	C++98	380 Bytes	2024-8-21 17:50:20
AC	uiuy (李潇睿666)	71ms	556 KiB	C++20(O2)	997 Bytes	2025-5-12 13:52:20
AC	费治铭	79ms	768 KiB	C++20	1.2 KiB	2025-3-20 13:17:23
AC	奶龙 (hterberjh4ewjn54hgbh4)	82ms	764 KiB	C++20(O2)	630 Bytes	2025-3-26 19:56:23