https://blog.youkuaiyun.com/SY_Yuzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/SY_Yu/article/details/80954685https://blog.youkuaiyun.com/SY_Yu/article/details/80954685SY_YuSat, 07 Jul 2018 20:57:04 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/80140536https://blog.youkuaiyun.com/SY_Yu/article/details/80140536SY_YuSun, 29 Apr 2018 00:53:44 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79955551https://blog.youkuaiyun.com/SY_Yu/article/details/79955551SY_YuMon, 16 Apr 2018 01:10:04 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79935947https://blog.youkuaiyun.com/SY_Yu/article/details/79935947SY_YuSun, 15 Apr 2018 22:15:19 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79286100https://blog.youkuaiyun.com/SY_Yu/article/details/79286100SY_YuThu, 08 Feb 2018 16:07:54 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79271049https://blog.youkuaiyun.com/SY_Yu/article/details/79271049SY_YuThu, 08 Feb 2018 09:09:51 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79238815https://blog.youkuaiyun.com/SY_Yu/article/details/79238815SY_YuFri, 02 Feb 2018 14:31:16 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79150394https://blog.youkuaiyun.com/SY_Yu/article/details/79150394SY_YuWed, 24 Jan 2018 14:25:04 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79131881https://blog.youkuaiyun.com/SY_Yu/article/details/79131881SY_YuMon, 22 Jan 2018 20:27:08 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79102202https://blog.youkuaiyun.com/SY_Yu/article/details/79102202SY_YuFri, 19 Jan 2018 01:29:31 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79070010https://blog.youkuaiyun.com/SY_Yu/article/details/79070010SY_YuThu, 18 Jan 2018 00:33:30 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79057124https://blog.youkuaiyun.com/SY_Yu/article/details/79057124SY_YuSun, 14 Jan 2018 15:59:34 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79056994https://blog.youkuaiyun.com/SY_Yu/article/details/79056994SY_YuSun, 14 Jan 2018 15:45:18 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/79049067https://blog.youkuaiyun.com/SY_Yu/article/details/79049067SY_YuSat, 13 Jan 2018 00:37:53 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/77432143https://blog.youkuaiyun.com/SY_Yu/article/details/77432143SY_YuSun, 20 Aug 2017 20:08:09 +0800 using namespace std;#define MAX_N 100010 int main(){ int a[MAX_N]; int n,k; scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } int c]]>https://blog.youkuaiyun.com/SY_Yu/article/details/77151757https://blog.youkuaiyun.com/SY_Yu/article/details/77151757SY_YuMon, 14 Aug 2017 00:25:49 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/76600035https://blog.youkuaiyun.com/SY_Yu/article/details/76600035SY_YuWed, 02 Aug 2017 23:42:20 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/70052415https://blog.youkuaiyun.com/SY_Yu/article/details/70052415SY_YuTue, 11 Apr 2017 13:58:56 +0800https://blog.youkuaiyun.com/SY_Yu/article/details/70048900https://blog.youkuaiyun.com/SY_Yu/article/details/70048900SY_YuTue, 11 Apr 2017 10:58:46 +0800#define MAX_N 110int house[MAX_N];int main(){ int n,m,k; scanf("%d%d%d",&n,&m,&k); for(int i=1;i<=n;i++){ scanf("%d",&house[i]); if(house[i]==0)]]>https://blog.youkuaiyun.com/SY_Yu/article/details/68489900https://blog.youkuaiyun.com/SY_Yu/article/details/68489900SY_YuThu, 30 Mar 2017 16:51:48 +0800 #include #include #include using namespace std; int main(){ int k; vector v; scanf("%d",&k); int n; while(k--){ scanf("%d]]>