@[剑圣夜雨声烦](/space/show?uid=98954) 这种dp题大佬您竟然翻车
by SkyLiYu @ 2018-07-12 20:23:57
~~导弹拦截不是暴力模拟么~~
by WAMonster @ 2018-07-12 20:24:02
@[剑圣夜雨声烦](/space/show?uid=98954) 这题大概不是最长上升子序列就是最长下降子序列记不清了,你还没说你怎么错的呢,你WA还是TLE,得了几分
by SkyLiYu @ 2018-07-12 20:24:53
@[超級·考場WA怪](/space/show?uid=73574) 您这种大佬的世界里dp和贪心都算暴力吧(滑稽)
by SkyLiYu @ 2018-07-12 20:25:25
@[隔壁小邱](/space/show?uid=22539) TLE,得了100分
by 不存在之人 @ 2018-07-12 20:25:36
@[隔壁小邱](/space/show?uid=22539) TLE..标签不是写了吗..
by moye到碗里来 @ 2018-07-12 20:25:45
他应该是AC机吧……
by 曾经的小玄XX @ 2018-07-12 20:25:48
@[剑圣夜雨声烦](/space/show?uid=98954)
$ \text{你看看我代码} $
```cpp
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 100050;
vector<int> v1, v2;
int A[maxn];
int main()
{
size_t asize = -1;
while (cin >> A[++asize]);
v1.push_back(A[0]);
v2.push_back(A[0]);
for (size_t i = 1; i < asize; i++)
{
if (A[i] <= v1.back())
v1.push_back(A[i]);
else
v1[lower_bound(v1.begin(), v1.end(), A[i], greater_equal<int>()) - v1.begin()] = A[i];
if (A[i] > v2.back())
v2.push_back(A[i]);
else
v2[lower_bound(v2.begin(), v2.end(), A[i]) - v2.begin()] = A[i];
}
cout << v1.size() << endl;
cout << v2.size() << endl;
#ifdef _MSC_VER
cin.clear();
cin >> ws;
#endif
return 0;
}
```
by andyli @ 2018-07-12 20:26:48
@[moye到碗里来](/space/show?uid=52576) 看走眼了(滑稽)
by SkyLiYu @ 2018-07-12 20:27:02
@[剑圣夜雨声烦](/space/show?uid=98954) 奥,我记起来了,这题数据加强了,不过你应该已经有绿色小勾勾了,这题加强数据需要优化
by SkyLiYu @ 2018-07-12 20:28:10