数组指定部分逆序重放

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	7ms	256 KiB		271 Bytes	2022-10-16 10:12:48
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	8ms	7.3 MiB		238 Bytes	2024-1-16 15:45:32
AC	时代二校+马嘉宸 (majiachen)	10ms	6.8 MiB		249 Bytes	2023-11-30 17:21:18
AC	hyh	11ms	6.8 MiB		245 Bytes	2023-11-15 20:13:15
AC	NJL (NJlL)	12ms	392 KiB		275 Bytes	2022-6-5 16:18:22
AC	ywh	12ms	384 KiB		259 Bytes	2022-6-18 19:39:20
AC	林文杰 (057)	12ms	392 KiB		274 Bytes	2022-6-14 20:34:17
AC	ZERO_VOID	12ms	384 KiB		262 Bytes	2022-6-11 11:57:10
AC	wangjunhan	12ms	384 KiB		298 Bytes	2022-5-28 19:33:56
AC	姚宏逸	12ms	384 KiB		254 Bytes	2022-5-18 6:47:33
AC	朱昱丞	12ms	384 KiB		314 Bytes	2022-6-5 20:32:53
AC	hyc	12ms	6.8 MiB		312 Bytes	2023-11-15 20:13:24
AC	肖添宇	12ms	384 KiB		297 Bytes	2022-5-29 19:23:51
AC	l;k (陈彬宾)	12ms	384 KiB		264 Bytes	2022-5-22 20:03:16
AC	冒牌陈杰晟【MOD】 (wed)	12ms	436 KiB		496 Bytes	2022-6-8 19:10:05
AC	XYZ303	12ms	384 KiB		267 Bytes	2022-5-22 19:24:56
AC	1396013295	12ms	392 KiB		241 Bytes	2022-5-29 10:04:21
AC	赵一嵘 (zhaoyirong)	13ms	392 KiB		254 Bytes	2022-6-3 17:45:34
AC	Z.饮月君 (张皓南)	13ms	384 KiB		286 Bytes	2022-6-26 10:46:29
AC	余彦瑞	13ms	392 KiB		266 Bytes	2022-6-26 10:38:30
AC	杨瀚霖 (yanghanlin)	13ms	384 KiB		286 Bytes	2023-5-20 10:09:38
AC	陈骏洋	13ms	392 KiB		278 Bytes	2022-5-29 19:23:54
AC	郑之策	13ms	384 KiB		264 Bytes	2022-5-29 19:23:05
AC	CMG	13ms	384 KiB		259 Bytes	2022-5-22 19:26:05
AC	杜俊宏	13ms	420 KiB		283 Bytes	2022-6-3 10:24:34
AC	杜是贤 (dushixian)	13ms	392 KiB		255 Bytes	2022-5-23 19:58:58
AC	梅子楠 (22016-mzn)	13ms	384 KiB		260 Bytes	2022-9-18 10:24:37
AC	吴俊成 (wujuncheng)	13ms	392 KiB		323 Bytes	2022-6-5 18:23:40
AC	范子煜	13ms	6.8 MiB	C++20	266 Bytes	2024-8-4 22:07:15
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	384 KiB		297 Bytes	2022-7-3 9:58:13
AC	zlx (xiao)	13ms	384 KiB		303 Bytes	2022-5-20 21:36:20
AC	bvvd	13ms	7 MiB	C++98	364 Bytes	2024-6-14 15:26:45
AC	刘锦航	13ms	400 KiB		249 Bytes	2022-5-29 19:26:55
AC	李哲 (lizhe)	13ms	512 KiB		312 Bytes	2022-7-25 23:02:56
AC	10255	13ms	7.2 MiB	C++17	254 Bytes	2024-5-16 18:59:31
AC	icwy (zuolun)	13ms	384 KiB		264 Bytes	2022-7-30 17:24:47
AC	scallway	13ms	384 KiB		246 Bytes	2023-2-4 13:18:23
AC	Randy Marsh (杨子腾)	13ms	384 KiB		294 Bytes	2022-5-29 19:22:01
AC	qhx	13ms	6.6 MiB	C++98(O2)	267 Bytes	2024-7-31 21:01:43
AC	刘煜轩	13ms	384 KiB		256 Bytes	2023-5-13 20:04:05
AC	郑妍汐	13ms	384 KiB		305 Bytes	2022-5-25 17:20:46
AC	陈杰晟	13ms	384 KiB		277 Bytes	2022-5-28 20:25:12
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)	13ms	392 KiB		419 Bytes	2022-12-9 18:38:08
AC	疯神芭芭脱丝 (李卓修)	13ms	384 KiB		292 Bytes	2022-5-29 19:22:24
AC	徐子恩 (Cow)	13ms	384 KiB		289 Bytes	2022-5-22 19:53:17
AC	kin of kin (jojo)	13ms	384 KiB		307 Bytes	2022-6-12 16:50:00
AC	微风将至 (李睿轩)	13ms	384 KiB		282 Bytes	2022-5-20 21:29:13
AC	李嘉瑞	13ms	384 KiB		308 Bytes	2022-5-28 19:19:22
AC	秦子越 (13883322087)	13ms	388 KiB		293 Bytes	2022-6-12 9:23:56
AC	龙沁均 (我是S神)	13ms	384 KiB		257 Bytes	2022-6-11 20:56:12
AC	Error404sans (焦阳浩云)	13ms	7 MiB	C++20(O2)	469 Bytes	2024-5-28 20:59:00
AC	凌肯 (lingken22006)	13ms	384 KiB		288 Bytes	2022-9-15 18:21:58
AC	缥 (王硕2012)	13ms	512 KiB		301 Bytes	2023-2-5 20:56:43
AC	魏楚浔 (shawn)	13ms	392 KiB		316 Bytes	2022-6-3 11:24:31
AC	刘老师 (图书管理员)	13ms	384 KiB		313 Bytes	2022-5-17 18:09:31
AC	原著校区巫映秋 (巫映秋1a)	13ms	384 KiB		247 Bytes	2023-4-5 15:43:20
AC	chen (peter)	13ms	384 KiB		256 Bytes	2022-5-28 20:26:55
AC	阮 (媚狐不吃道旁李)	13ms	7.3 MiB	C++98	253 Bytes	2024-5-18 17:21:58
AC	田信 (tianxincn1)	13ms	392 KiB		238 Bytes	2022-5-29 16:06:16
AC	张瑞博	13ms	6.8 MiB	C++11	246 Bytes	2024-7-3 11:01:25
AC	Steven (王梓丞)	13ms	384 KiB		287 Bytes	2022-7-5 16:14:50
AC	靳博然 (jbr)	13ms	384 KiB		270 Bytes	2023-5-21 18:07:33
AC	黄翼廷	13ms	6.9 MiB	C++98	294 Bytes	2024-6-27 17:53:00
AC	xuniaoyin (徐袅音)	13ms	6.8 MiB	C++98(O2)	268 Bytes	2024-7-2 10:29:24
AC	崔欧辰	13ms	6.6 MiB	C++11	312 Bytes	2024-7-10 21:44:43
AC	无尽的想象 (谭仕高)	13ms	384 KiB		256 Bytes	2022-8-27 17:38:29
AC	新壹街——陈学彬 (BUG)	13ms	440 KiB		265 Bytes	2022-5-28 19:31:25
AC	不怎么聪明的家伙 (贺俊楠)	13ms	7 MiB	C++98(O2)	262 Bytes	2024-5-13 21:34:11
AC	邵冠铖 (shaoguancheng22031)	13ms	384 KiB		244 Bytes	2023-3-5 12:12:07
AC	霍弈丞小号	13ms	392 KiB		272 Bytes	2023-1-31 11:46:53
AC	伍芷函	13ms	424 KiB		274 Bytes	2023-5-2 17:20:54
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	13ms	384 KiB		257 Bytes	2022-5-28 19:39:02
AC	汤杰尧 (05c05-tjy1)	13ms	384 KiB		291 Bytes	2022-11-4 21:56:41
AC	极为的好van的 (lyq)	13ms	384 KiB		234 Bytes	2022-7-28 10:33:20
AC	赵泳鑫 (zhaoyongxin)	13ms	400 KiB		262 Bytes	2022-5-29 19:22:16
AC	jinitaimei	13ms	384 KiB		231 Bytes	2022-11-27 18:40:58
AC	huangpucwx	13ms	6.8 MiB	C++11	314 Bytes	2024-5-22 15:32:18
AC	郭益豪（帅哥） (guoyihao)	13ms	392 KiB		361 Bytes	2023-4-16 17:51:52
AC	苏晨懿	13ms	392 KiB		289 Bytes	2023-5-13 16:24:52
AC	朱老师 (zyp)	13ms	512 KiB		281 Bytes	2022-7-31 16:10:43
AC	ttt123	13ms	440 KiB		348 Bytes	2022-8-11 14:28:08
AC	ddz	13ms	384 KiB		257 Bytes	2022-6-11 20:53:04
AC	luozixi	14ms	436 KiB		231 Bytes	2023-2-15 20:33:31
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	412 KiB		251 Bytes	2022-12-3 16:03:11
AC	安闵煜 (anzai)	14ms	6.7 MiB	C++11	318 Bytes	2024-8-3 1:42:47
AC	lch (凌昌瀚)	14ms	432 KiB		230 Bytes	2022-7-9 18:39:58
AC	chenyifei	14ms	392 KiB		234 Bytes	2022-6-5 14:45:58
AC	喵 (蹇心悦)	14ms	436 KiB		310 Bytes	2022-8-14 10:22:42
AC	新一街校区Jason_LuoYouZheng (罗友峥)	14ms	392 KiB		266 Bytes	2022-5-28 19:37:26
AC	德意志第三帝国 (陈远桥)	14ms	392 KiB		278 Bytes	2022-5-29 19:26:48
AC	huyinuo	14ms	384 KiB		294 Bytes	2022-5-21 13:52:36
AC	陈佳婧	14ms	384 KiB		230 Bytes	2022-9-9 20:43:17
AC	11111	14ms	512 KiB		320 Bytes	2022-6-8 18:45:09
AC	李树崑 (lishukun)	14ms	508 KiB		315 Bytes	2022-6-23 20:08:52
AC	偽艺術家 (chenyanchi22006)	14ms	436 KiB		378 Bytes	2022-7-6 12:07:15
AC	张梓辰 (DiaoDesi屌德斯)	14ms	408 KiB		255 Bytes	2022-9-15 19:53:58
AC	22029-lsl	14ms	392 KiB		304 Bytes	2022-12-24 10:27:51
AC	明哲瀚 (18580067605)	14ms	384 KiB		274 Bytes	2023-3-11 18:53:20
AC	李林峰 (金克拉)	14ms	384 KiB		253 Bytes	2022-8-31 20:22:21
AC	18523558128zcn	14ms	440 KiB		301 Bytes	2022-7-6 11:03:02