摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=3603#include#include#include#define N 300001int n;int vis[N];int pre[N];int dp[N][19];void swap(int *a,int *b){ *a+=*b; *b=*a-*b; *a-=*b;}int b_search(int x,int y){ int m; int k=0; int v=x; while(x>1; if(pre[m]b) return 0; k=(i... 阅读全文