F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
大视野在线测评-欢迎您
[ New Thread ]
Problem 5311 >> 这题是一道卡读入好题
SmallFat @ 2018-05-04 19:58:49
[ Quote ] [ Edit ] [ Delete ] 1#
请用fread/mmap读入!我程序2/3的时间耗在读入和求前缀和
EdwardFrog @ 2018-05-04 22:23:39
[ Quote ] [ Edit ] [ Delete ] 2#
请问决策单调性能过吗?
还是有不带log的做法?
lavendir @ 2018-05-05 09:17:03
[ Quote ] [ Edit ] [ Delete ] 3#
问了作者时限定成多少,还没回复。
SmallFat @ 2018-05-05 19:56:46
[ Quote ] [ Edit ] [ Delete ] 4#
决策单调性能过该题,另@lavendir不必改时限,复杂度瓶颈也在读入,毕竟读入3e7,后面计算量nlognlogm
SmallFat @ 2018-05-05 19:58:02
[ Quote ] [ Edit ] [ Delete ] 5#
后面O(nm)也行
Izumihanako @ 2018-05-10 19:56:39
[ Quote ] [ Edit ] [ Delete ] 6#
me感觉std的做法十分的迷...
不知道可不可以卡
kczno1 @ 2018-05-16 14:38:57
[ Quote ] [ Edit ] [ Delete ] 7#
nklog过不了啊。。
kczno1 @ 2018-05-16 15:05:50
[ Quote ] [ Edit ] [ Delete ] 8#
std做法是什么啊
kczno1 @ 2018-05-16 15:18:29
[ Quote ] [ Edit ] [ Delete ] 9#
n^2卡常过了。。
Izumihanako @ 2018-05-17 09:48:18
[ Quote ] [ Edit ] [ Delete ] 10#
请问n^2是什么做法啊emmmmm
EdwardFrog @ 2018-05-17 14:44:54
[ Quote ] [ Edit ] [ Delete ] 11#
在APIO上学会了n^2做法23333
Izumihanako @ 2018-05-17 16:58:35
[ Quote ] [ Edit ] [ Delete ] 12#
me突然觉得me sabi了...
me貌似会n^2了...
zsyzhz @ 2019-04-03 21:46:25
[ Quote ] [ Edit ] [ Delete ] 13#
弱弱地问一句O(nm)怎么做啊
zsyzhz @ 2019-04-03 22:01:41
[ Quote ] [ Edit ] [ Delete ] 14#
怎么做到比输入复杂度还优秀的啊
369389379 @ 2019-08-07 09:41:09
[ Quote ] [ Edit ] [ Delete ] 15#
这题可以O(nlogVlogn)....wqs二分+决策单调性优化不过输入的复杂度貌似比这个大。。。
369389379 @ 2019-08-07 10:37:05
[ Quote ] [ Edit ] [ Delete ] 16#
艹,O(nlogVlogn)写完了后加了fread竟然还跑了2600ms,这也太卡读入了
[Top] [Previous Page] [Next Page]

HOME Back