求最大值

状态	递交者	时间	内存	代码	递交时间
AC	弹射起飞 ? 冲 ! (吴周周)	31ms	388 KiB	252 Bytes	2023-4-8 17:42:01
AC	爱琴海校区-黄辰浩 (huangchenhao)	31ms	6.9 MiB	335 Bytes	2023-7-1 20:39:30
AC	hnd (陈皓洋)	31ms	512 KiB	208 Bytes	2022-11-16 21:23:56
AC	ttt123	31ms	440 KiB	324 Bytes	2023-1-5 16:35:12
AC	zhangheyi22006	31ms	6.9 MiB	168 Bytes	2023-9-10 10:34:06
AC	新一街校区Jason_LuoYouZheng (罗友峥)	31ms	424 KiB	281 Bytes	2023-5-18 20:23: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)	31ms	440 KiB	224 Bytes	2022-11-13 16:41:36
AC	蓝色妖姬 (jiangpeiyu)	31ms	384 KiB	182 Bytes	2022-10-29 9:10:47
AC	王祎辰 (wangyichen)	31ms	6.7 MiB	250 Bytes	2023-9-7 20:24:37
AC	繁星 (05c35-zzm)	31ms	436 KiB	208 Bytes	2022-11-15 17:04:56
AC	王浚西 (22016-wjx)	31ms	436 KiB	243 Bytes	2023-3-26 12:10:07
AC	余彦瑞	31ms	512 KiB	202 Bytes	2022-8-31 15:54:02
AC	科比.布莱恩特 (董浩琰)	31ms	432 KiB	224 Bytes	2023-3-18 20:18:50
AC	黄立信	31ms	440 KiB	268 Bytes	2022-12-3 12:06:08
AC	***	31ms	420 KiB	197 Bytes	2023-3-3 18:53:39
AC	凌肯 (lingken22006)	31ms	512 KiB	261 Bytes	2022-7-31 21:52:48
AC	soha (武夷岩)	31ms	384 KiB	202 Bytes	2022-10-15 17:07:54
AC	22029-lsl	31ms	440 KiB	237 Bytes	2022-11-19 10:44:39
AC	***	31ms	512 KiB	197 Bytes	2023-3-2 15:25:38
AC	zzzrrrxxx	31ms	6.8 MiB	163 Bytes	2023-7-16 13:39:19
AC	yxj	31ms	440 KiB	191 Bytes	2022-10-20 15:56:56
AC	一个小黑	31ms	7 MiB	265 Bytes	2024-1-13 19:04:36
AC	新壹街校区-周士杰 (zsj)	31ms	6.7 MiB	191 Bytes	2023-8-28 9:37:53
AC	江坤锜	31ms	512 KiB	240 Bytes	2023-3-18 19:51:39
AC	时代二校-王盼兮 (wangpanxi)	31ms	7.3 MiB	237 Bytes	2024-1-21 11:26:08
AC	叶雨昊 (yeyuhao22006)	31ms	512 KiB	204 Bytes	2022-10-23 19:56:33
AC	蒲梓勋 (puzixun)	31ms	512 KiB	201 Bytes	2022-11-29 22:21:35
AC	小忙果 (王昱杰)	32ms	6.9 MiB	210 Bytes	2023-7-18 8:35:51
AC	dengfeng	32ms	512 KiB	208 Bytes	2022-12-29 10:49:46
AC	胡程禹	32ms	512 KiB	224 Bytes	2023-3-18 20:06:13
AC	樊竣熠 (lft1114)	32ms	512 KiB	286 Bytes	2022-8-19 15:11:15
AC	王昱祺 (12王昱祺)	32ms	6.9 MiB	197 Bytes	2023-10-29 16:45:31
AC	444444444 (唐跃元)	32ms	432 KiB	159 Bytes	2023-3-16 21:36:29
AC	德克萨斯做的到吗 (liyangbao)	32ms	444 KiB	185 Bytes	2022-11-10 18:19:17
AC	靳博然 (jbr)	32ms	448 KiB	220 Bytes	2023-3-26 17:09:40
AC	lichenrui23010	32ms	6.8 MiB	220 Bytes	2023-8-27 15:35:13
AC	龚铭俊 (哈哈哈)	32ms	6.9 MiB	193 Bytes	2023-7-23 13:41:09
AC	龚铭俊 (哈哈哈)	32ms	6.9 MiB	205 Bytes	2023-7-23 13:44:27
AC	稻妻第一深情 (喝酒の吟游诗人)	32ms	444 KiB	1.4 KiB	2023-1-11 15:37:57
AC	余晨浩 (yuchenhao)	32ms	6.9 MiB	188 Bytes	2023-8-21 11:20:49
AC	Randy Marsh (杨子腾)	32ms	512 KiB	269 Bytes	2022-10-1 15:01:57
AC	时代1校-杨宇轩 (杨宇轩)	32ms	564 KiB	198 Bytes	2023-4-1 9:32:21
AC	zcx	32ms	384 KiB	222 Bytes	2022-11-16 16:09:31
AC	yuhaodi	32ms	512 KiB	230 Bytes	2023-4-24 18:43:23
AC	坤坤荔枝小黑子 (zhonghaotian22006)	32ms	440 KiB	261 Bytes	2022-9-6 20:39:57
AC	韦孟巡_1	32ms	440 KiB	337 Bytes	2023-4-9 17:24:50
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	32ms	392 KiB	211 Bytes	2022-12-10 11:43:27
AC	曹埊睿 (caodirui)	32ms	432 KiB	206 Bytes	2023-4-19 22:32:24
AC	炸鱼4000+ (dxc)	32ms	436 KiB	208 Bytes	2023-3-18 19:47:18
AC	wuqi	33ms	6.9 MiB	279 Bytes	2023-7-23 14:14:39
AC	任远宁 (renyuanning)	33ms	432 KiB	223 Bytes	2023-2-19 20:07:25
AC	liangyuntian1	33ms	7 MiB	183 Bytes	2023-6-28 17:59:20
AC	陈于硕(我™的) (chenyu)	33ms	512 KiB	239 Bytes	2023-3-11 11:15:50
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	33ms	424 KiB	275 Bytes	2023-1-15 16:14:56
AC	杜是贤 (dushixian)	33ms	512 KiB	185 Bytes	2022-10-2 11:34:15
AC	胡澜之 (666hlz666)	33ms	6.9 MiB	294 Bytes	2023-6-28 20:45:24
AC	陈家齐 (陈家齐1)	33ms	428 KiB	208 Bytes	2023-3-25 12:16:27
AC	执剑人罗辑 (Jasson)	33ms	512 KiB	212 Bytes	2023-1-25 17:16:40
AC	444444444 (唐跃元)	33ms	512 KiB	159 Bytes	2023-1-21 11:07:20
AC	丛林 (conglin)	33ms	432 KiB	229 Bytes	2022-12-2 22:00:22
AC	laiyouming22031	33ms	512 KiB	174 Bytes	2022-11-27 12:09:16
AC	时代二校-陈天成 (鸭缩毛巾)	33ms	392 KiB	168 Bytes	2023-4-8 17:46:04
AC	dyp (hhy)	33ms	6.9 MiB	275 Bytes	2023-7-5 18:24:04
AC	李树崑 (lishukun)	33ms	444 KiB	223 Bytes	2022-11-5 12:45:04
AC	彭崇鑫	33ms	512 KiB	193 Bytes	2022-10-22 13:45:07
AC	wzzjnb2012	33ms	448 KiB	226 Bytes	2022-9-30 8:17:46
AC	时代一校蒋帛希 (13983392730)	33ms	6.9 MiB	221 Bytes	2023-7-9 14:07:05
AC	shenyushun2	34ms	440 KiB	214 Bytes	2022-12-24 21:56:01
AC	徐正旺 (xzw)	34ms	512 KiB	165 Bytes	2022-11-24 17:58:26
AC	时代2校+涂彦迪 (tuyandi)	34ms	6.9 MiB	204 Bytes	2023-7-18 16:58:46
AC	希蒙 (zhengxingya)	34ms	8.1 MiB	277 Bytes	2023-8-21 16:10:08
AC	陈红恺 (chk)	34ms	444 KiB	251 Bytes	2022-10-9 21:12:11
AC	56 (13883454928)	34ms	7 MiB	265 Bytes	2023-11-25 18:30:28
AC	张承暄	34ms	7.2 MiB	183 Bytes	2023-7-4 10:50:46
AC	wuzhenghan	34ms	384 KiB	200 Bytes	2022-11-2 21:42:07
AC	RanHao	35ms	6.9 MiB	234 Bytes	2023-7-22 10:59:48
AC	没有此人 (akm)	35ms	6.9 MiB	312 Bytes	2023-7-2 19:01:06
AC	朱泽晟	35ms	384 KiB	407 Bytes	2022-9-2 17:19:14
AC	爱情海校区—沙天一 (沙天一)	35ms	7.1 MiB	167 Bytes	2023-7-9 9:31:36
AC	colin1112 (墙凌可)	35ms	512 KiB	212 Bytes	2023-1-22 12:39:24
AC	11451254188 (22029-mjh)	35ms	512 KiB	237 Bytes	2022-11-18 22:58:38
AC	huanglu	35ms	512 KiB	247 Bytes	2022-8-13 13:09:35
AC	童艺涵	35ms	512 KiB	224 Bytes	2022-11-30 15:19:44
AC	呵呵呵 (陈思琦)	35ms	384 KiB	181 Bytes	2022-10-15 17:06:47
AC	杨馨涵	35ms	7.1 MiB	181 Bytes	2023-12-20 18:37:27
AC	wuzhenghan	35ms	384 KiB	224 Bytes	2022-11-2 21:41:57
AC	苏庭毅	35ms	392 KiB	192 Bytes	2023-3-18 20:10:27
AC	苏庭毅	36ms	384 KiB	192 Bytes	2023-3-18 20:10:25
AC	漆星语 (qixingyu)	36ms	7.1 MiB	199 Bytes	2023-7-3 9:24:35
AC	苏庭毅	36ms	384 KiB	192 Bytes	2023-3-18 20:10:26
AC	苏庭毅	36ms	416 KiB	192 Bytes	2023-3-18 20:10:24
AC	maobohan	36ms	7.3 MiB	196 Bytes	2023-12-16 10:02:43
AC	新壹街陈科言 (cky)	37ms	7 MiB	219 Bytes	2023-7-19 11:38:23
AC	朱老师 (zyp)	37ms	512 KiB	226 Bytes	2022-11-28 20:02:14
AC	陈诺	37ms	7.1 MiB	177 Bytes	2023-12-31 11:12:37
AC	苏庭毅	38ms	384 KiB	192 Bytes	2023-3-18 20:10:24
AC	Harley (郑浩然)	38ms	7.4 MiB	218 Bytes	2023-7-10 18:56:48
AC	^_^ (ctc)	38ms	512 KiB	189 Bytes	2022-10-12 16:10:21
AC	杨浩灵 (金坷拉)	38ms	7 MiB	287 Bytes	2023-7-20 17:11:41
AC	苏庭毅	38ms	432 KiB	192 Bytes	2023-3-18 20:09:33