-100分求助

P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G

```cpp for(j=i+2;a[j]<k;j++) a[j-1]=a[j]; ``` 所以真的能访问到 $k$ 吗
by Fleeing_loser @ 2023-07-05 20:40:24


这不是小根堆吗?
by _Adolf_Hitler_ @ 2023-07-05 20:47:26


不是,重点不是在10个RE上吗 @[JODAN_POOLE](/user/931106) @[Fleeing_loser](/user/541145)
by renzecheng @ 2023-07-05 20:56:02


@[renzecheng](/user/616059) 所以我上面说的就是 RE 的原因啊
by Fleeing_loser @ 2023-07-05 20:57:22


可以吧 不过我开了10000 * 10 不会爆
by renzecheng @ 2023-07-05 21:09:53


@[Fleeing_loser](/user/541145)
by renzecheng @ 2023-07-05 21:17:18


@[renzecheng](/user/616059) 您再看看10000个20000真的能访问到吗
by Fleeing_loser @ 2023-07-05 21:24:17


访问不到顶多WA,不会RE
by renzecheng @ 2023-07-05 22:07:58


@[Fleeing_loser](/user/541145)
by renzecheng @ 2023-07-05 22:08:27


@[renzecheng](/user/616059) 所以您觉得 ``` int n,a[101]; n=1000000; cout<<a[n]; ``` 这会WA 但不会 RE?
by Fleeing_loser @ 2023-07-05 22:22:38


| 下一页