|
写出来第一题dp，特此纪念
|
|
|
日常二分写错
 |
|
|
································································································································································································································································································································································································································································································································
|
|
|
|
|
|
线段树是什么鬼
题目 1398 最长上升子序列
2019-08-11 21:01:37
|
|
|
数据有问题，最后一个点中最长上升子序列为 0 1 2 3 4 5 6 7 8 9 10 56 96 101
0不是正整数； 这样会导致程序输出13（正解为14）； 正在请求老师修复 |
|
|
写反了，很丢人
|
|
|
呵呵呵
|
|
|
有毒吧
题目 1398 最长上升子序列
2018-04-09 21:33:20
|
|
|
大神看看为什么不对啊
|
|
|
s[0]=-1,欲哭无泪
|
|
|
数据竟然有0，五光十色好难受
题目 1398 最长上升子序列
2017-11-07 19:51:14
|
|
|
谢谢程老师给的数据范围！（因为我不会nlogn的算法(-｡-;）
|
|
|
时隔许久重写
|
|
|
多少年没犯过的傻逼错误。。。。数组大小正好开了1000.。。
|
|
|
数组范围搞成0-1001...继而初始化又写成0....orz实在是蒟蒻
题目 1398 最长上升子序列
2017-06-20 15:05:57
|
|
|
专业打表
|
|
|
|
|
|
第一次文件名打错了
 |
|
|
|