henry's PS diary

I've traveled from Seoul to Haenam which is located in the most southern area of Korea by bicycle with my friends. We rode almost 80 km every day. On the first day of the journey, I felt really exhausted, and then I was used to it. Our plan was to go to Busan after Haenam and go up along the East sea. One of my friends got injured lightly before we arrived in Haenam, so we changed the plan. I wa..

https://www.acmicpc.net/problem/12015 lower_bound를 이용해서 O(nlogn)만에 LIS를 만들 수 있다. 직접 예제들을 만들어서 동작 과정을 살펴보면 이해가 쉽다. 1234567891011121314151617181920#include #include #include using namespace std; int main(){ int n,m; scanf("%d",&n); vector l; l.push_back(-1); while(n--) { scanf("%d",&m); if(l.back()

https://www.acmicpc.net/problem/5639 preorder의 순서인 root->left->right을 이용해서 재귀적으로 범위를 설정해서 postorder의 순서인 left->right->root로 바꾼다. 123456789101112131415161718192021#include int n,a[10001]; void go(int l,int r){ if(l>r) return; int m=l; while(a[++m]