guojiaqi007的专栏

https://www.patest.cn/contests/pat-t-practise/1009 这道题首先用了一个简单的dp： const int maxn = 1e5 + 2; int lar[maxn]; int a[maxn]; int main() { int n, k, ans = 0; scanf("%d", &n); for (int i = 0; i <

https://www.patest.cn/contests/pat-t-practise/1010 离散化+树状数组 code from http://blog.youkuaiyun.com/jtjy568805874/article/details/50898105 #include #include using namespace std; const int max