听取MLE声一片 @ 2020-11-08 15:58:09
大家时间复杂度是多少啊
我那不太正确做法好像是O(T)(数据组数)
by devout @ 2020-11-08 16:05:00
我写的
by Spasmodic @ 2020-11-08 16:05:01
by WarningQAQ @ 2020-11-08 16:07:56
by Vocalise @ 2020-11-08 16:10:22
求助,
by tiger0134 @ 2020-11-08 16:17:23
by littleKtian @ 2020-11-08 16:21:16
by 很离谱的人 @ 2020-11-08 16:26:44
我的做法是while(k)(就是每次询问的日期大小)
判断是否大于365/366天,年++,k-=365/366
大于一个月,月++,k-=28/29/30/31
否则,日++,k=0
然后是O(n*(k%365+(k%365)%30+1))