求助TLE #3 关于时间复杂度

P1868 饥饿的奶牛

@[XiaoYiii](/user/1025891) 你的 H 数组也要开M
by yyandy @ 2024-02-10 14:00:42


@[angiing1222](/user/718025) ? ```cpp for(int j = h[i]; j != -1; j = g[j].next){ maxx = Max(maxx, f[g[j].from - 1] - g[j].from + 1); } ``` 这段语句最多执行 $n$ 次,不管外面有几重循坏,因为最多只有 $n$ 个区间
by XiaoYiii @ 2024-02-10 14:02:08


@[yyandy](/user/234101) 谢谢,已经AC力
by XiaoYiii @ 2024-02-10 14:03:40


@[XiaoYiii](/user/1025891) ( 没看清题
by angiing1222 @ 2024-02-10 14:05:03


|