c___c18的博客

题目链接 Write a program which reads an integer n and draws a Koch curve based on recursive calles of depth n. The Koch curve is well known as a kind of fractals. You can draw a Koch curve in the following algorithm: Divide a given segment (p1, p2) into three

MooFest Every year, Farmer John’s N (1 <= N <= 20,000) cows attend “MooFest”,a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, fe...

1.最小堆的实现参考：https://blog.csdn.net/genios/article/details/8157031 int a[N]; void Build(){ for(int i=n/2;i>=1;i--){ int tem=a[i]; int j=i*2; while(j<=n){ if...

在这里我就不赘述他们的概念了，前辈们写的很详细： https://blog.csdn.net/qq_34154570/article/details/82700094 https://www.cnblogs.com/lanhaicode/p/10390147.html 我就直接用例题来说明吧 #include <cstdio> #include <iostream> #i...