数组逆序输出

状态	递交者	时间	内存	代码	递交时间
AC	欧俊阳	15ms	384 KiB	201 Bytes	2023-3-18 10:58:35
AC	经常消失 (小萝卜)	15ms	384 KiB	236 Bytes	2022-2-14 15:21:27
AC	煞笔笔	15ms	6.7 MiB	182 Bytes	2023-9-28 18:36:00
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	436 KiB	236 Bytes	2023-3-5 9:24:14
AC	huanglu	15ms	7 MiB	218 Bytes	2023-7-18 15:05:44
AC	SB (mfy01)	15ms	392 KiB	207 Bytes	2022-11-5 17:26:18
AC	https://www.minecraft.net/zh-hans (王振西)	15ms	6.9 MiB	193 Bytes	2023-6-18 14:28:57
AC	欧俊阳	15ms	436 KiB	201 Bytes	2023-3-3 21:03:29
AC	姚宏逸	15ms	384 KiB	296 Bytes	2023-4-1 13:44:39
AC	李旻轩	15ms	7.4 MiB	226 Bytes	2023-6-10 19:07:39
AC	xuniaoyin (徐袅音)	15ms	512 KiB	180 Bytes	2023-5-5 20:19:34
AC	朱老师 (zyp)	15ms	436 KiB	189 Bytes	2023-4-21 15:47:13
AC	zhangheyi22006	15ms	436 KiB	198 Bytes	2022-8-13 18:29:34
AC	黄诗童 (hst01)	15ms	384 KiB	201 Bytes	2022-11-5 17:29:12
AC	在煎鱼的肖大总铳 (肖宇航)	15ms	512 KiB	242 Bytes	2022-8-8 17:08:25
AC	雷承翰1	15ms	384 KiB	225 Bytes	2023-4-8 19:58:31
AC	时代一校-王宥量 (wangyouliang)	15ms	512 KiB	192 Bytes	2022-11-6 15:20:01
AC	苏庭毅	15ms	384 KiB	212 Bytes	2023-4-8 19:41:13
AC	chenyantong	15ms	384 KiB	181 Bytes	2023-2-10 21:02:43
AC	scallway	15ms	384 KiB	189 Bytes	2023-5-28 15:03:26
AC	时代一校-曾科智 (曾科智)	15ms	540 KiB	297 Bytes	2022-9-10 20:27:47
AC	zhangyouze (张佑泽)	15ms	6.8 MiB	219 Bytes	2023-10-17 21:44:28
AC	曲奇饼干	15ms	416 KiB	208 Bytes	2023-5-24 16:50:22
AC	时代1校-杨宇轩 (杨宇轩)	15ms	512 KiB	185 Bytes	2023-5-8 21:37:55
AC	张梓浩 (zhangzihao)	15ms	384 KiB	221 Bytes	2023-4-1 10:57:27
AC	黄梓桐 (HuangZiTong)	15ms	440 KiB	205 Bytes	2022-8-13 21:14:18
AC	hyh22031	15ms	6.7 MiB	186 Bytes	2023-9-8 20:17:48
AC	soha (武夷岩)	15ms	392 KiB	228 Bytes	2023-4-15 15:39:39
AC	lihaoyi	15ms	384 KiB	233 Bytes	2022-12-11 10:38:44
AC	dyp (hhy)	15ms	6.8 MiB	174 Bytes	2023-9-2 11:38:23
AC	zhangzhixiong	15ms	7 MiB	192 Bytes	2023-6-18 15:09:15
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)	15ms	448 KiB	238 Bytes	2022-11-27 9:33:40
AC	葛琮扬	15ms	384 KiB	212 Bytes	2022-11-5 17:31:31
AC	德克萨斯做的到吗 (liyangbao)	15ms	520 KiB	214 Bytes	2022-11-12 10:29:48
AC	强奸肾[冷漠] (05c41-zjb)	15ms	384 KiB	326 Bytes	2022-11-5 17:12:10
AC	庹仕杰	15ms	384 KiB	203 Bytes	2023-5-13 15:11:47
AC	苏庭毅	15ms	424 KiB	212 Bytes	2023-4-8 19:41:13
AC	SYH.邵允涵 (Zoe邵)	15ms	512 KiB	207 Bytes	2023-2-24 18:09:26
AC	王瀚毅 (wanghanyi)	15ms	444 KiB	181 Bytes	2022-12-4 10:09:29
AC	Tender. (05c05-zhou)	15ms	436 KiB	198 Bytes	2022-10-18 11:40:47
AC	sqmyb	15ms	440 KiB	194 Bytes	2023-2-19 17:57:41
AC	杨淇瑞 (杨淇瑞29)	15ms	6.7 MiB	223 Bytes	2023-9-18 21:59:01
AC	cupy战士 (05c05-dkf)	15ms	6.9 MiB	224 Bytes	2023-9-24 11:41:05
AC	月下的九尾银狐	15ms	6.9 MiB	185 Bytes	2023-9-9 10:57:46
AC	dustsans (njo)	15ms	468 KiB	200 Bytes	2022-10-28 20:53:02
AC	苏庭毅	15ms	512 KiB	212 Bytes	2023-4-8 19:41:09
AC	叶雨昊 (yeyuhao22006)	15ms	444 KiB	183 Bytes	2022-10-23 20:14:47
AC	欧俊阳	15ms	384 KiB	201 Bytes	2023-3-18 10:58:33
AC	李奎龙 (Judge_lkl)	15ms	384 KiB	203 Bytes	2022-10-29 20:51:21
AC	爱琴海校区jzn (jzn)	15ms	384 KiB	177 Bytes	2023-3-18 10:11:44
AC	kkksc03 (彭士锋)	15ms	444 KiB	197 Bytes	2022-3-12 13:21:12
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.9 MiB	176 Bytes	2023-7-25 12:47:20
AC	欧俊阳	15ms	384 KiB	201 Bytes	2023-3-18 10:58:28
AC	苏庭毅	15ms	392 KiB	212 Bytes	2023-4-8 19:41:08
AC	田世瑞	15ms	384 KiB	215 Bytes	2023-3-26 14:08:45
AC	欧俊阳	15ms	384 KiB	201 Bytes	2023-3-18 10:58:30
AC	chenjunyao	15ms	6.8 MiB	194 Bytes	2023-6-10 9:40:30
AC	周琳竣1	15ms	7.1 MiB	440 Bytes	2023-12-17 18:19:41
AC	欧俊阳	15ms	384 KiB	201 Bytes	2023-3-18 10:58:35
AC	syc	15ms	6.8 MiB	186 Bytes	2023-11-2 20:04:35
AC	王重道	15ms	384 KiB	230 Bytes	2023-5-27 15:33:45
AC	の (魏子恒)	15ms	428 KiB	213 Bytes	2022-8-31 18:47:23
AC	时代二校-王盼兮 (wangpanxi)	15ms	6.7 MiB	197 Bytes	2023-8-25 15:14:32
AC	苏庭毅	15ms	384 KiB	212 Bytes	2023-4-8 19:41:08
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.9 MiB	176 Bytes	2023-7-25 12:45:47
AC	不怎么聪明的家伙 (贺俊楠)	15ms	384 KiB	217 Bytes	2023-3-26 14:35:59
AC	11451254188 (22029-mjh)	15ms	436 KiB	251 Bytes	2022-11-29 13:24:38
AC	张玉坚 (zhangyuian)	15ms	432 KiB	184 Bytes	2023-2-23 22:36:04
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	15ms	384 KiB	210 Bytes	2022-10-28 20:56:25
AC	enen	15ms	6.8 MiB	204 Bytes	2023-6-10 11:01:06
AC	我很6 (zjj22031)	15ms	512 KiB	162 Bytes	2022-12-15 16:32:44
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	15ms	512 KiB	231 Bytes	2022-1-25 15:52:01
AC	熊奕博 (Mothefuck)	15ms	448 KiB	206 Bytes	2023-2-24 19:18:12
AC	黄誉翔 (黄誉翔)	15ms	440 KiB	271 Bytes	2022-10-29 20:50:26
AC	86想要钱 (twt)	15ms	448 KiB	220 Bytes	2022-10-30 18:38:04
AC	时代一校蒋帛希 (13983392730)	15ms	392 KiB	201 Bytes	2022-10-30 18:48:56
AC	你猜呀	15ms	436 KiB	181 Bytes	2023-3-16 19:01:27
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	384 KiB	190 Bytes	2022-9-3 18:57:32
AC	六 (江智昕)	15ms	440 KiB	218 Bytes	2023-2-25 12:05:17
AC	稻妻第一深情 (喝酒の吟游诗人)	15ms	416 KiB	1.3 KiB	2023-3-12 0:04:35
AC	彭崇鑫	15ms	384 KiB	198 Bytes	2023-4-15 15:08:36
AC	赵彬鸿	15ms	384 KiB	176 Bytes	2022-5-28 15:04:11
AC	dyz	15ms	6.7 MiB	186 Bytes	2023-8-26 13:48:10
AC	爱情海校区—沙天一 (沙天一)	15ms	432 KiB	217 Bytes	2023-3-23 19:21:31
AC	lll	15ms	6.9 MiB	898 Bytes	2023-6-30 11:24:32
AC	昌文迪 (05c05-cwd2)	15ms	384 KiB	205 Bytes	2022-11-3 18:07:08
AC	欧俊阳	15ms	384 KiB	201 Bytes	2023-3-18 10:58:36
AC	欧俊阳	15ms	512 KiB	201 Bytes	2023-3-18 10:58:25
AC	吴攸 (wuyou)	15ms	416 KiB	185 Bytes	2023-5-28 15:02:11
AC	在煎鱼的肖大总铳 (肖宇航)	15ms	384 KiB	242 Bytes	2022-8-8 17:14:20
AC	易锦程 (sky)	15ms	6.8 MiB	229 Bytes	2023-11-1 20:28:21
AC	hxb	15ms	384 KiB	220 Bytes	2022-11-25 13:50:54
AC	苏庭毅	15ms	392 KiB	212 Bytes	2023-4-8 19:40:57
AC	lll	15ms	6.9 MiB	582 Bytes	2023-6-30 11:22:59
AC	李禹衡 (liyuheng22006)	15ms	432 KiB	195 Bytes	2022-8-28 12:18:23
AC	苏庭毅	15ms	392 KiB	212 Bytes	2023-4-8 19:41:07
AC	xyc (谢雨宸)	15ms	512 KiB	200 Bytes	2023-5-28 9:17:41
AC	游智棋	15ms	384 KiB	251 Bytes	2022-10-16 9:41:28
AC	杨颂恩 (yangsongen)	15ms	6.9 MiB	204 Bytes	2023-8-17 18:06:23
AC	郑尧 (zhengyao)	15ms	6.9 MiB	495 Bytes	2023-6-29 20:20:46