摘要: 2024,1,26 今天做石子合并的题比较多 贴一个模板 for (int len = 2; len <= n; len++) { for (int i = 1, j; (j = i + len - 1) <= n; i++) { for (int k = i; k < j; k++) { if(d 阅读全文
posted @ 2024-01-26 22:50 contiguous 阅读(58) 评论(0) 推荐(0) 编辑