https://blog.youkuaiyun.com/Fisticezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Fistice/article/details/78155889https://blog.youkuaiyun.com/Fistice/article/details/78155889FisticeTue, 03 Oct 2017 19:29:05 +0800https://blog.youkuaiyun.com/Fistice/article/details/76221796https://blog.youkuaiyun.com/Fistice/article/details/76221796FisticeThu, 27 Jul 2017 21:13:23 +0800https://blog.youkuaiyun.com/Fistice/article/details/68154834https://blog.youkuaiyun.com/Fistice/article/details/68154834FisticeWed, 29 Mar 2017 21:47:50 +08001； 让你求出这些球最少分几个集合。 1<=ai<=1e9,1<=n<=500; 分析: 枚举找出最小的单位x，让每个颜色的球都能分成若]]>https://blog.youkuaiyun.com/Fistice/article/details/68130641https://blog.youkuaiyun.com/Fistice/article/details/68130641FisticeWed, 29 Mar 2017 21:23:12 +0800https://blog.youkuaiyun.com/Fistice/article/details/68113849https://blog.youkuaiyun.com/Fistice/article/details/68113849FisticeWed, 29 Mar 2017 21:08:13 +0800https://blog.youkuaiyun.com/Fistice/article/details/60473644https://blog.youkuaiyun.com/Fistice/article/details/60473644FisticeSun, 05 Mar 2017 20:05:41 +0800 using namespace std; typedef long long ll; const int maxn=1e6+5; char s[maxn],str[maxn]; int p[2*maxn]; void work(]]>https://blog.youkuaiyun.com/Fistice/article/details/53010583https://blog.youkuaiyun.com/Fistice/article/details/53010583FisticeWed, 02 Nov 2016 18:44:53 +0800https://blog.youkuaiyun.com/Fistice/article/details/53010390https://blog.youkuaiyun.com/Fistice/article/details/53010390FisticeWed, 02 Nov 2016 18:15:17 +0800https://blog.youkuaiyun.com/Fistice/article/details/52963293https://blog.youkuaiyun.com/Fistice/article/details/52963293FisticeSat, 29 Oct 2016 10:53:06 +0800https://blog.youkuaiyun.com/Fistice/article/details/52927893https://blog.youkuaiyun.com/Fistice/article/details/52927893FisticeTue, 25 Oct 2016 22:11:30 +0800https://blog.youkuaiyun.com/Fistice/article/details/52927689https://blog.youkuaiyun.com/Fistice/article/details/52927689FisticeTue, 25 Oct 2016 21:50:56 +0800=2，所以不用考虑n,m是]]>https://blog.youkuaiyun.com/Fistice/article/details/52927603https://blog.youkuaiyun.com/Fistice/article/details/52927603FisticeTue, 25 Oct 2016 21:40:25 +0800 using namespace std; int main() { int n; scanf("%d",&n); int a[5]]]>https://blog.youkuaiyun.com/Fistice/article/details/52927577https://blog.youkuaiyun.com/Fistice/article/details/52927577FisticeTue, 25 Oct 2016 21:37:38 +0800 using namespace std; int main() { char a[205],b[205]; gets(a),gets(b); int]]>https://blog.youkuaiyun.com/Fistice/article/details/52927549https://blog.youkuaiyun.com/Fistice/article/details/52927549FisticeTue, 25 Oct 2016 21:35:11 +0800 using namespace std; int main() { int t; scanf("%d",&t); mapmp; mp.c]]>https://blog.youkuaiyun.com/Fistice/article/details/52833203https://blog.youkuaiyun.com/Fistice/article/details/52833203FisticeSun, 16 Oct 2016 21:32:28 +0800https://blog.youkuaiyun.com/Fistice/article/details/52833030https://blog.youkuaiyun.com/Fistice/article/details/52833030FisticeSun, 16 Oct 2016 21:13:52 +0800https://blog.youkuaiyun.com/Fistice/article/details/52832992https://blog.youkuaiyun.com/Fistice/article/details/52832992FisticeSun, 16 Oct 2016 21:05:38 +0800https://blog.youkuaiyun.com/Fistice/article/details/52832924https://blog.youkuaiyun.com/Fistice/article/details/52832924FisticeSun, 16 Oct 2016 20:57:07 +0800 using namespace std; int main(]]>https://blog.youkuaiyun.com/Fistice/article/details/52819675https://blog.youkuaiyun.com/Fistice/article/details/52819675FisticeFri, 14 Oct 2016 22:47:46 +0800https://blog.youkuaiyun.com/Fistice/article/details/52818129https://blog.youkuaiyun.com/Fistice/article/details/52818129FisticeFri, 14 Oct 2016 18:30:44 +0800 using namespace std; const int N=20,M=1005,INF=0x3f3f3f3f; int c[N][N],dis[N],s,t; int]]>