奇数单增序列

状态	递交者	时间	内存	语言	代码	递交时间
AC	zzl	9ms	384 KiB		827 Bytes	2022-12-29 18:39:28
AC	李树崑 (lishukun)	9ms	312 KiB		606 Bytes	2022-8-16 11:56:34
AC	李山水	13ms	392 KiB		472 Bytes	2022-6-12 17:37:35
AC	朱泓屹 (ZYH)	13ms	384 KiB		351 Bytes	2022-6-12 20:31:02
AC	kin of kin (jojo)	13ms	404 KiB		658 Bytes	2022-6-12 17:45:43
AC	l;k (陈彬宾)	13ms	396 KiB		340 Bytes	2022-6-12 20:28:04
AC	CMG	13ms	384 KiB		329 Bytes	2022-6-12 20:27:59
AC	zlx (xiao)	14ms	384 KiB		390 Bytes	2022-6-5 19:57:21
AC	吴俊成 (wujuncheng)	14ms	392 KiB		344 Bytes	2022-6-7 18:09:28
AC	秦子越 (13883322087)	14ms	384 KiB		351 Bytes	2022-6-12 22:06:46
AC	汪致卉 (wangzh)	14ms	424 KiB		550 Bytes	2022-6-10 15:38:09
AC	NJL (NJlL)	14ms	384 KiB		315 Bytes	2022-6-12 17:33:12
AC	ddz	14ms	392 KiB		523 Bytes	2022-6-11 19:51:11
AC	刘锦航	14ms	392 KiB		336 Bytes	2022-6-12 17:47:34
AC	姚宏逸	14ms	392 KiB		522 Bytes	2022-6-5 19:53:56
AC	张玉坚 (zhangyuian)	14ms	392 KiB		321 Bytes	2023-3-5 16:24:44
AC	龙沁均 (我是S神)	14ms	384 KiB		640 Bytes	2022-6-11 19:47:51
AC	soha (武夷岩)	14ms	392 KiB		371 Bytes	2023-5-20 17:20:13
AC	冒牌陈杰晟【MOD】 (wed)	14ms	512 KiB		486 Bytes	2022-6-11 12:42:53
AC	chenxiyu	14ms	392 KiB		361 Bytes	2023-5-20 17:19:44
AC	张梓辰	14ms	384 KiB		420 Bytes	2022-9-14 20:25:10
AC	朱昱丞	14ms	384 KiB		374 Bytes	2022-6-12 20:36:04
AC	zjm	14ms	392 KiB		303 Bytes	2023-4-16 11:44:20
AC	chen (peter)	14ms	392 KiB		523 Bytes	2022-6-11 19:55:24
AC	什蒂尔布 (吴东航)	14ms	512 KiB		298 Bytes	2023-5-7 8:10:45
AC	徐子恩 (Cow)	14ms	384 KiB		336 Bytes	2022-6-12 20:36:54
AC	彭崇鑫	14ms	384 KiB		292 Bytes	2023-5-20 17:29:40
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	14ms	392 KiB		640 Bytes	2022-6-11 19:47:05
AC	孙烽轶 (sfy)	14ms	384 KiB		290 Bytes	2023-5-20 17:04:00
AC	ttt123	14ms	384 KiB		334 Bytes	2023-4-15 11:55:24
AC	scallway	14ms	384 KiB		316 Bytes	2023-5-20 18:00:16
AC	wangjunhan	14ms	384 KiB		411 Bytes	2022-6-11 20:34:32
AC	陈杰晟	14ms	440 KiB		540 Bytes	2022-6-7 15:57:47
AC	杜俊宏	14ms	432 KiB		487 Bytes	2022-7-12 15:43:36
AC	陈杰晟	14ms	424 KiB		375 Bytes	2022-6-11 20:36:02
AC	伍芷函	15ms	384 KiB		519 Bytes	2023-3-5 16:19:46
AC	灵光sans (wangchihao)	15ms	384 KiB		318 Bytes	2023-5-20 17:17:35
AC	火爆肥肠（杨弘毅） (火爆肥肠)	15ms	384 KiB		483 Bytes	2022-6-8 21:44:13
AC	疯神芭芭脱丝 (李卓修)	15ms	392 KiB		404 Bytes	2022-7-17 18:20:45
AC	罗伟杰 (13308275065)	15ms	440 KiB		445 Bytes	2022-12-5 20:56:54
AC	huyinuo	15ms	384 KiB		590 Bytes	2022-6-6 21:45:44
AC	霍弈丞小号	15ms	384 KiB		377 Bytes	2023-3-5 16:30:28
AC	余彦瑞	15ms	384 KiB		335 Bytes	2023-3-5 16:24:14
AC	(金沙天街)严皓月 (严皓月)	15ms	384 KiB		326 Bytes	2023-5-17 19:37:43
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	15ms	384 KiB		269 Bytes	2023-4-16 11:27:22
AC	CK (李弘毅)	15ms	384 KiB		318 Bytes	2023-5-20 17:20:41
AC	新一街校区Jason_LuoYouZheng (罗友峥)	15ms	384 KiB		411 Bytes	2022-6-11 20:37:21
AC	时代校区-刘臣原 (微笑王子)	15ms	436 KiB		445 Bytes	2022-9-14 20:24:06
AC	无尽的想象 (谭仕高)	15ms	388 KiB		283 Bytes	2022-9-1 14:15:47
AC	熊奕博 (Mothefuck)	15ms	392 KiB		399 Bytes	2023-3-5 16:31:09
AC	朱老师 (zyp)	15ms	384 KiB		291 Bytes	2023-4-16 11:23:09
AC	zcx	15ms	392 KiB		422 Bytes	2023-5-18 18:41:22
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	15ms	392 KiB		269 Bytes	2023-4-16 11:27:27
AC	lihaoyi	15ms	384 KiB		294 Bytes	2023-4-16 11:26:23
AC	邵冠铖 (shaoguancheng22031)	15ms	384 KiB		257 Bytes	2023-4-16 11:25:29
AC	荣耀	15ms	6.7 MiB		258 Bytes	2023-8-30 15:21:31
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	384 KiB		445 Bytes	2023-4-16 10:46:13
AC	我很6 (zjj22031)	15ms	384 KiB		290 Bytes	2023-4-16 11:24:12
AC	马渝杭 (mayuhang)	15ms	384 KiB		427 Bytes	2022-9-1 15:30:05
AC	22029-lyh	15ms	384 KiB		392 Bytes	2023-4-16 10:57:06
AC	zhm123	15ms	392 KiB		359 Bytes	2023-5-1 16:15:31
AC	zhangzhixiong	15ms	6.8 MiB		486 Bytes	2023-6-22 15:37:10
AC	22029-hqh	15ms	384 KiB		319 Bytes	2023-4-15 12:13:35
AC	偽艺術家 (chenyanchi22006)	15ms	440 KiB		330 Bytes	2022-7-18 10:53:18
AC	22029-hqh	16ms	384 KiB		319 Bytes	2023-4-15 12:13:42
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	384 KiB		359 Bytes	2023-1-31 17:55:31
AC	wuqilin	16ms	436 KiB		316 Bytes	2023-2-1 15:02:33
AC	黄梓桐 (HuangZiTong)	16ms	384 KiB		299 Bytes	2022-9-1 12:18:57
AC	86想要钱 (twt)	16ms	512 KiB		304 Bytes	2023-2-17 19:31:58
AC	杜启苇1	16ms	384 KiB		268 Bytes	2022-12-8 19:30:38
AC	22029-hqh	16ms	392 KiB		319 Bytes	2023-4-15 12:13:41
AC	文硕 (文硕1)	16ms	512 KiB		349 Bytes	2023-2-2 17:10:11
AC	22029-zjs	16ms	428 KiB		336 Bytes	2023-4-15 12:03:31
AC	时代二校-陈天成 (鸭缩毛巾)	16ms	6.7 MiB		339 Bytes	2023-9-10 11:51:54
AC	李彭宋代诗人 (ljy123456)	16ms	448 KiB		434 Bytes	2023-4-5 21:29:00
AC	赵泳鑫 (zhaoyongxin)	16ms	384 KiB		442 Bytes	2022-7-17 18:35:44
AC	严晗予 (yanhanyu)	16ms	7 MiB		430 Bytes	2024-1-7 15:05:33
AC	时代2校-程俊燃 (chengjunran)	16ms	6.7 MiB		312 Bytes	2023-9-13 20:57:41
AC	甄一阳 (22016-zyy)	16ms	384 KiB		425 Bytes	2022-12-4 10:04:14
AC	周琪渃	16ms	512 KiB		455 Bytes	2023-2-2 15:54:26
AC	22029-lsl	16ms	384 KiB		291 Bytes	2023-4-15 11:57:40
AC	ttt123	16ms	384 KiB		318 Bytes	2023-4-14 23:03:11
AC	hyh22031	16ms	396 KiB		283 Bytes	2023-4-16 11:28:01
AC	王昱祺 (12王昱祺)	16ms	6.8 MiB		417 Bytes	2023-6-13 16:18:45
AC	Z.饮月君 (张皓南)	16ms	436 KiB		428 Bytes	2022-11-4 16:34:10
AC	小根哥	16ms	384 KiB		445 Bytes	2022-9-1 11:55:47
AC	22029-zjs	16ms	512 KiB		292 Bytes	2023-5-30 19:50:49
AC	huanglu	16ms	512 KiB		566 Bytes	2022-9-23 13:09:53
AC	杜启苇1	16ms	384 KiB		268 Bytes	2022-12-8 19:22:13
AC	杜启苇1	16ms	384 KiB		268 Bytes	2022-12-8 19:27:11
AC	zhangzhimo	16ms	440 KiB		602 Bytes	2022-12-4 13:19:16
AC	原著校区巫映秋 (巫映秋1a)	16ms	6.7 MiB		360 Bytes	2023-6-4 17:30:32
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)	16ms	384 KiB		385 Bytes	2023-4-15 11:54:10
AC	时代一校-赵彦博 (zyb)	16ms	6.7 MiB		381 Bytes	2023-8-26 15:38:27
AC	金沙校区-先珂熠 (九转大肠)	16ms	6.9 MiB	C++20	376 Bytes	2024-8-17 20:33:17
AC	陈雨泽1	16ms	492 KiB		349 Bytes	2023-2-1 18:49:37
AC	伍芷函	16ms	432 KiB		511 Bytes	2023-1-31 11:12:23
AC	张梓辰 (DiaoDesi屌德斯)	17ms	384 KiB		422 Bytes	2022-9-14 20:25:59
AC	罗伟杰 (13308275065)	17ms	512 KiB		445 Bytes	2022-12-8 19:09:27
AC	赵沛喆	17ms	452 KiB		411 Bytes	2022-11-6 9:26:50