【深基4.例2】找最小值

状态	递交者	时间	内存	语言	代码	递交时间
AC	^_^ (ctc)	32ms	448 KiB		173 Bytes	2022-12-7 11:22:48
AC	黄梓轩 (huangzixuan)	32ms	6.9 MiB		269 Bytes	2023-7-27 17:04:26
AC	(张洛诚)	32ms	464 KiB		276 Bytes	2023-4-29 18:50:43
AC	chaikexu	32ms	444 KiB		229 Bytes	2022-11-24 14:06:13
AC	杨颂恩 (yangsongen)	32ms	6.8 MiB		420 Bytes	2023-11-8 18:59:40
AC	UsMt1 (jiangyuan)	32ms	6.9 MiB		205 Bytes	2023-7-29 11:33:23
AC	杜俊宏	32ms	444 KiB		211 Bytes	2022-4-24 18:29:55
AC	谭懿轩 (yanyixuan)	32ms	448 KiB		182 Bytes	2022-2-15 18:24:57
AC	火爆肥肠（杨弘毅） (火爆肥肠)	32ms	456 KiB		275 Bytes	2022-3-19 15:53:01
AC	xiangsiyu	32ms	560 KiB		192 Bytes	2022-6-23 19:55:24
AC	凌肯 (lingken22006)	33ms	440 KiB		262 Bytes	2022-8-31 18:12:57
AC	李哲 (lizhe)	33ms	6.9 MiB		227 Bytes	2023-6-9 19:40:07
AC	钟睿煊 (zhongruixuan)	33ms	460 KiB		175 Bytes	2023-5-7 19:08:52
AC	偽艺術家 (chenyanchi22006)	33ms	436 KiB		180 Bytes	2022-8-15 22:33:37
AC	人间理想小俗气	33ms	512 KiB		292 Bytes	2022-1-26 19:57:27
AC	wangruibo20xh	33ms	460 KiB		162 Bytes	2022-2-11 13:46:19
AC	杨瀚霖 (yanghanlin)	33ms	6.8 MiB		231 Bytes	2023-6-10 18:36:35
AC	qwerty	33ms	436 KiB		240 Bytes	2022-3-12 9:57:18
AC	疯神芭芭脱丝 (李卓修)	33ms	444 KiB		294 Bytes	2022-1-25 18:29:09
AC	qinjin	33ms	412 KiB		190 Bytes	2022-3-30 20:29:30
AC	坤坤荔枝小黑子 (zhonghaotian22006)	33ms	412 KiB		269 Bytes	2022-9-6 20:21:03
AC	chen (peter)	33ms	544 KiB		294 Bytes	2023-2-25 18:54:13
AC	肖添宇	33ms	464 KiB		320 Bytes	2022-4-16 17:58:54
AC	芒苒忧 (廖迦南)	33ms	512 KiB		182 Bytes	2022-8-15 14:27:47
AC	冒牌陈杰晟【MOD】 (wed)	33ms	512 KiB		194 Bytes	2022-2-28 19:06:01
AC	代尚函笛卡尔 (daishanghan)	33ms	448 KiB		223 Bytes	2022-8-28 12:49:12
AC	黄梓桐 (HuangZiTong)	33ms	448 KiB		210 Bytes	2022-7-20 17:14:31
AC	zry	33ms	448 KiB		185 Bytes	2022-3-12 11:19:07
AC	时代二校-陈天成 (鸭缩毛巾)	33ms	512 KiB		179 Bytes	2023-4-30 16:37:02
AC	时代一校-赵彦博 (zyb)	33ms	6.9 MiB		221 Bytes	2023-8-4 15:39:05
AC	张瑞博	33ms	7.2 MiB	C++11	182 Bytes	2024-4-30 20:57:11
AC	luoluonuoya	33ms	460 KiB		279 Bytes	2022-2-20 15:13:44
AC	新一街校区Jason_LuoYouZheng (罗友峥)	33ms	448 KiB		264 Bytes	2023-4-10 21:07:27
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	33ms	396 KiB		218 Bytes	2023-1-8 13:22:31
AC	1396013295	33ms	408 KiB		349 Bytes	2022-1-22 18:10:00
AC	hnd (陈皓洋)	34ms	452 KiB		344 Bytes	2022-8-28 16:13:57
AC	leisixian (22029-lyh)	34ms	444 KiB		230 Bytes	2023-4-18 19:03:00
AC	huyinuo	34ms	512 KiB		204 Bytes	2022-3-14 18:59:40
AC	我推忘归人 (贺俊楠)	34ms	6.7 MiB		257 Bytes	2023-6-4 12:22:41
AC	罗兰（漆黑襟默) (zhangxiaoci)	34ms	392 KiB		188 Bytes	2022-8-28 20:15:02
AC	朱老师 (zyp)	34ms	468 KiB		220 Bytes	2022-8-6 11:32:41
AC	凌肯 (lingken22006)	34ms	392 KiB		262 Bytes	2022-8-31 18:12:57
AC	爱琴海校区-刁钲洋 (刁钲洋)	34ms	468 KiB		207 Bytes	2023-2-8 18:46:16
AC	凌肯 (lingken22006)	34ms	448 KiB		262 Bytes	2022-8-31 18:12: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)	34ms	512 KiB		269 Bytes	2023-5-14 19:18:53
AC	罗翌珂 (dangdang)	34ms	644 KiB		220 Bytes	2022-8-29 12:06:52
AC	蓝色妖姬 (jiangpeiyu)	34ms	464 KiB		282 Bytes	2022-11-1 20:24:17
AC	11451254188 (22029-mjh)	34ms	6.9 MiB		382 Bytes	2023-8-4 10:48:16
AC	hnd (陈皓洋)	34ms	512 KiB		344 Bytes	2022-8-28 14:43:23
AC	徐正旺 (xzw)	35ms	448 KiB		165 Bytes	2022-11-27 14:13:29
AC	曹埊睿 (caodirui)	35ms	576 KiB		197 Bytes	2023-5-4 19:40:32
AC	吕同学是傻逼 (黄立信)	35ms	464 KiB		176 Bytes	2022-12-3 17:53:50
AC	colin1112 (墙凌可)	35ms	452 KiB		212 Bytes	2023-3-11 15:01:18
AC	何星震 (Jacob)	35ms	512 KiB		224 Bytes	2023-2-6 20:21:35
AC	张瑞博	35ms	7.2 MiB	C++11	182 Bytes	2024-4-20 23:26:59
AC	陈红恺 (chk)	35ms	576 KiB		256 Bytes	2022-8-29 15:26:09
AC	Randy Marsh (杨子腾)	35ms	468 KiB		270 Bytes	2022-10-1 15:35:22
AC	汤杰尧 (05c05-tjy1)	35ms	448 KiB		200 Bytes	2022-6-7 23:13:41
AC	Jack	35ms	472 KiB		189 Bytes	2023-3-15 19:22:23
AC	德克萨斯做的到吗 (liyangbao)	36ms	512 KiB		283 Bytes	2022-11-7 17:20:55
AC	陈雨泽1	36ms	7 MiB		272 Bytes	2024-1-24 10:19:36
AC	TBB (杜昊燃)	37ms	400 KiB		192 Bytes	2022-1-29 21:52:43
AC	杨坤霖 (steven)	37ms	512 KiB		304 Bytes	2023-1-16 8:48:50
AC	马渝杭 (mayuhang)	37ms	492 KiB		243 Bytes	2023-3-21 19:11:40
AC	凌肯 (lingken22006)	37ms	480 KiB		262 Bytes	2022-8-31 18:12:57
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	37ms	448 KiB		196 Bytes	2022-8-31 18:37:41
AC	张承暄	37ms	7.5 MiB		184 Bytes	2023-7-4 11:30:51
AC	杨在云 (yangzaiyun001)	37ms	464 KiB		160 Bytes	2022-8-29 21:39:57
AC	杨军方 (lyx2000)	37ms	512 KiB		171 Bytes	2022-3-6 16:01:32
AC	罗竣瀚	38ms	464 KiB		149 Bytes	2022-8-29 8:40:45
AC	朱泽晟	38ms	580 KiB		189 Bytes	2022-2-13 12:45:43
AC	丛林 (conglin)	38ms	460 KiB		214 Bytes	2022-12-2 21:14:06
AC	邵冠铖 (shaoguancheng22031)	38ms	536 KiB		178 Bytes	2022-12-8 13:35:58
AC	杜启苇 (duqiwei)	38ms	6.9 MiB		175 Bytes	2023-6-9 19:40:33
AC	谁陪訫牞（杀手） (22029-zys)	39ms	480 KiB		203 Bytes	2023-2-7 18:36:10
AC	zzl	39ms	6.8 MiB		210 Bytes	2023-11-7 0:44:25
AC	yuhaodi	39ms	384 KiB		202 Bytes	2023-5-13 11:26:32
AC	MoonLight ( aaa)	39ms	392 KiB		237 Bytes	2022-1-15 11:06:26
AC	况奕辛 (KYX_yyds)	39ms	464 KiB		228 Bytes	2022-3-8 20:58:56
AC	朱泽晟	40ms	588 KiB		189 Bytes	2022-3-13 10:12:38
AC	李彭宋代诗人 (ljy123456)	40ms	456 KiB		237 Bytes	2023-3-23 7:01:06
AC	没有此人 (akm)	40ms	456 KiB		199 Bytes	2023-2-3 18:04:10
AC	RanHao	40ms	6.9 MiB		183 Bytes	2023-7-22 11:38:31
AC	王韵淮	40ms	384 KiB		167 Bytes	2022-5-18 20:16:43
AC	https://www.crazygames.com/game/merge-construct (陈诺)	41ms	7.1 MiB		197 Bytes	2024-1-2 16:30:42
AC	05c05-yyc	41ms	460 KiB		235 Bytes	2022-9-4 19:39:41
AC	wuqi	41ms	6.9 MiB		279 Bytes	2023-7-25 15:15:59
AC	wuzhenghan	41ms	568 KiB		199 Bytes	2023-2-3 15:14:14
AC	陈骏逸 (chenjunyi)	43ms	6.8 MiB		219 Bytes	2023-6-9 19:32:30
AC	炸鱼4000+ (dxc)	45ms	6.9 MiB		186 Bytes	2023-11-28 21:39:35
AC	周琪渃	46ms	4.2 MiB		301 Bytes	2022-12-9 19:49:40
AC	李安桐23025	46ms	7.1 MiB		233 Bytes	2023-12-4 21:55:06
AC	dyp (hhy)	47ms	7.1 MiB		249 Bytes	2023-12-8 20:14:15
AC	时代一校-赵彦博 (zyb)	49ms	6.8 MiB		235 Bytes	2023-11-30 18:53:46
AC	新壹街校区-冉睦阳（想要无敌天下吗，葵花宝典有售，不要18880，只要9999） (冉睦阳)	51ms	7 MiB		222 Bytes	2023-12-17 12:10:06
AC	坤坤荔枝小黑子 (zhonghaotian22006)	51ms	640 KiB		269 Bytes	2022-9-6 20:20:56
AC	黄立信是XXS (吕同学)	51ms	7.2 MiB		226 Bytes	2024-1-22 14:10:55
AC	周琪渃	51ms	4.4 MiB		301 Bytes	2022-12-9 19:49:40
AC	周琪渃	51ms	4.4 MiB		301 Bytes	2022-12-7 19:40:34
AC	https://www.crazygames.com/game/merge-construct (陈诺)	60ms	7.1 MiB		196 Bytes	2024-1-2 16:30:27