https://blog.youkuaiyun.com/LOI_pingxingzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/LOI_pingxing/article/details/78494149https://blog.youkuaiyun.com/LOI_pingxing/article/details/78494149LOI_pingxingThu, 09 Nov 2017 21:14:09 +0800 #include using namespace std; const int MAXN = 200000 + 50; int st[MAXN][30]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78488827https://blog.youkuaiyun.com/LOI_pingxing/article/details/78488827LOI_pingxingThu, 09 Nov 2017 13:48:04 +0800 #include #include #define LL long long using namespace std; const int MAXN = 200000 + 50; struct]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78487194https://blog.youkuaiyun.com/LOI_pingxing/article/details/78487194LOI_pingxingThu, 09 Nov 2017 11:00:26 +0800 #include #include #include #define L(w) w << 1 #define R(w) w << 1|1 #define INF 1061109567 type]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78485154https://blog.youkuaiyun.com/LOI_pingxing/article/details/78485154LOI_pingxingThu, 09 Nov 2017 08:13:40 +0800 #include #include #include using namespace std; const int M]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78482942https://blog.youkuaiyun.com/LOI_pingxing/article/details/78482942LOI_pingxingWed, 08 Nov 2017 20:36:31 +0800小排序 就从最大的选 然而仅仅这样复杂度不会降…… 需要配合后缀和食用 当发现目前已选+后面待选的总和（即都选）依然比目前答案要小时，不搜 因为已经按大小排过序了，搜到较大答案的时间靠前的可能性比较大 达到减枝效果#include #in]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78472123https://blog.youkuaiyun.com/LOI_pingxing/article/details/78472123LOI_pingxingTue, 07 Nov 2017 20:31:37 +0800 #include #include #include typedef long l]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78461877https://blog.youkuaiyun.com/LOI_pingxing/article/details/78461877LOI_pingxingMon, 06 Nov 2017 20:59:11 +0800 #include #include #include #define LL long long using namespace std; const int MAXN = 1000 + 50; int n]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78446452https://blog.youkuaiyun.com/LOI_pingxing/article/details/78446452LOI_pingxingSat, 04 Nov 2017 21:58:49 +0800 #include #includehttps://blog.youkuaiyun.com/LOI_pingxing/article/details/78445163https://blog.youkuaiyun.com/LOI_pingxing/article/details/78445163LOI_pingxingSat, 04 Nov 2017 18:38:10 +0800https://blog.youkuaiyun.com/LOI_pingxing/article/details/78441439https://blog.youkuaiyun.com/LOI_pingxing/article/details/78441439LOI_pingxingSat, 04 Nov 2017 09:38:08 +0800https://blog.youkuaiyun.com/LOI_pingxing/article/details/78439786https://blog.youkuaiyun.com/LOI_pingxing/article/details/78439786LOI_pingxingFri, 03 Nov 2017 21:15:32 +0800https://blog.youkuaiyun.com/LOI_pingxing/article/details/78437058https://blog.youkuaiyun.com/LOI_pingxing/article/details/78437058LOI_pingxingFri, 03 Nov 2017 16:38:50 +0800 #include #include #define LL long long #define P 10007 using namespace std; const int MAXN = 20000 + 50; LL]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78428877https://blog.youkuaiyun.com/LOI_pingxing/article/details/78428877LOI_pingxingThu, 02 Nov 2017 20:15:27 +0800https://blog.youkuaiyun.com/LOI_pingxing/article/details/78427214https://blog.youkuaiyun.com/LOI_pingxing/article/details/78427214LOI_pingxingThu, 02 Nov 2017 17:24:00 +0800a，L –>b，Y - X]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78421757https://blog.youkuaiyun.com/LOI_pingxing/article/details/78421757LOI_pingxingThu, 02 Nov 2017 10:10:55 +0800 #include #include #include #defin]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78420725https://blog.youkuaiyun.com/LOI_pingxing/article/details/78420725LOI_pingxingThu, 02 Nov 2017 08:38:06 +0800 #include #define LL long long int n,m; int prime[10000010],cnt; bool sh[10000010]; void solve(int n){ for(int i = 2;i <= n;i ++){ if(!sh[i])prime[++cnt] = i;]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78417033https://blog.youkuaiyun.com/LOI_pingxing/article/details/78417033LOI_pingxingWed, 01 Nov 2017 18:21:00 +0800https://blog.youkuaiyun.com/LOI_pingxing/article/details/78401104https://blog.youkuaiyun.com/LOI_pingxing/article/details/78401104LOI_pingxingTue, 31 Oct 2017 11:02:16 +0800 #include #include #include using namespace std; int x,n,v[10010],cnt; int dp[10010],ans = 10010; bool exist[1001]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78387195https://blog.youkuaiyun.com/LOI_pingxing/article/details/78387195LOI_pingxingSun, 29 Oct 2017 19:27:03 +0800 next长度为i时向前匹配的次数 那在找第i位的答案时只需要]]>https://blog.youkuaiyun.com/LOI_pingxing/article/details/78387033https://blog.youkuaiyun.com/LOI_pingxing/article/details/78387033LOI_pingxingSun, 29 Oct 2017 18:52:47 +0800 #include #include #include using namespace std; const int MAXN = 1000000 + 50; char s1[MAXN],s2[MAXN]; int next[MAXN]; int n,m,ans; int main(){]]>