摘要: 传送门:https://www.luogu.com.cn/problem/P1795 ①:暴力暴力~ 其实就是找到所有是1的位置,存起来,然后对照输出 但是感觉坑点蛮多的,C++输出换行用endl超时,得改成\n #include <bits/stdc++.h> using namespace st 阅读全文
posted @ 2026-10-09 00:10 yi_one 阅读(2) 评论(0) 推荐(0)
摘要: 题目来源于洛谷:https://www.luogu.com.cn/problem/P3009 瞄一眼tag...诶,是分治...小小蒟蒻对于分治理解实在不到位... 凭借之前做题的灵感💡,很容易想到了可以求前缀和,找到最大的前缀和,然后找在它之前的最小的前缀和,二者相减就是答案ans (这里很容易 阅读全文
posted @ 2026-10-08 22:23 yi_one 阅读(2) 评论(0) 推荐(0)
摘要: ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007231849167-145639688.png) ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007231855168-301414768.png) ![im 阅读全文
posted @ 2026-10-07 23:19 yi_one 阅读(3) 评论(0) 推荐(0)
摘要: ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007231431114-1386166777.png) ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007231438067-1783835224.png) ![ 阅读全文
posted @ 2026-10-07 23:14 yi_one 阅读(3) 评论(0) 推荐(0)
摘要: ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007224336267-113494085.png) ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007224428018-1484284095.png) ![i 阅读全文
posted @ 2026-10-07 22:44 yi_one 阅读(3) 评论(0) 推荐(0)
摘要: ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007223853070-1649625348.png) ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007223900736-850424528.png) ![i 阅读全文
posted @ 2026-10-07 22:40 yi_one 阅读(3) 评论(0) 推荐(0)
摘要: ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007223439835-450774746.png) ![image](https://img2024.cnblogs.com/blog/3794022/202610/3794022-20261007225739606-1661321624.png) ![i 阅读全文
posted @ 2026-10-07 22:35 yi_one 阅读(2) 评论(0) 推荐(0)
摘要: 思路:求i左边最小的前缀和,求i右边最大的前缀和然后相减就是最大的 阅读全文
posted @ 2026-10-07 22:25 yi_one 阅读(3) 评论(0) 推荐(0)