没有方法的算法代码

  1 using System;
  2 using System.Collections.Generic;
  3 using System.Diagnostics;
  4 using System.IO;
  5 using System.Linq;
  6 using System.Runtime.Serialization;
  7 using System.Runtime.Serialization.Formatters.Binary;
  8 using System.Text;
  9 using System.Threading;
 10 using System.Threading.Tasks;
 11 
 12 namespace ConsoleApplication1
 13 {
 14     class Program
 15     {
 16 
 17 
 18         static void Main(string[] args)
 19         {
 20             A a = new A();
 21             a.Init(10000, 100000);
 22             a.Show();
 23 
 24             Console.WriteLine("k");
 25             Stopwatch sw = new Stopwatch();
 26             sw.Start();
 27             a.Calc();
 28             sw.Stop();
 29 
 30             Console.WriteLine("初始值:{0},总消耗值:{1},耗时:{2}", a.InitValue, a.Total,sw.Elapsed);
 31 
 32             Console.ReadLine();
 33         }
 34 
 35 
 36     }
 37 
 38     public class A
 39     {
 40         public List<int> List = new List<int>();
 41 
 42         public void Init(int n, int max)
 43         {
 44             Random ran = new Random();
 45             while (n > 0)
 46             {
 47                 //生成max以内的整数
 48                 List.Add(ran.Next(max)+1);
 49                 n--;
 50             }
 51         }
 52 
 53         public void Show() {
 54             foreach (int a in List) {
 55                 Console.Write("\t {0}", a);
 56             }
 57             Console.WriteLine();
 58         }
 59 
 60 
 61         public int InitValue = 0;
 62         public int Total = 0;
 63         private List<int> sums = new List<int>();
 64 
 65         public void Calc()
 66         {
 67             //1.找出最小值和最大值 O(n)
 68             int min = List[0];
 69             int max = List[0];
 70             foreach (var a in List)
 71             {
 72                 if (a < min) min = a;
 73                 if (a > max) max = a;
 74             }
 75 
 76             //2.从最小值开始 依次计算出每个数的结果和O(n^3)
 77             for (int i = min; i <= max; i++)
 78             {
 79                 InitValue = i;
 80                 int sum = 0;
 81                 foreach (int a in List)
 82                 {
 83                     sum += FindCeil(a, i)-a;
 84                 }
 85                 sums.Add(sum);
 86             }
 87 
 88             //3.找出最小的O(n)
 89             int minsum = sums[0];
 90             int mini = 0;
 91             for (int i = 0; i < sums.Count; i++)
 92             {
 93                 if (sums[i] < minsum)
 94                 {
 95                     minsum = sums[i];
 96                     mini = i;
 97                 }
 98             }
 99 
100             InitValue = min + mini;
101             Total = sums[mini];
102         }
103 
104         //找出初始值为initValue对于num的最近的一个Ceil值
105         private int FindCeil(int num, int initValue)
106         {
107             int v = 0;
108             for (int i = 0; i < num; i++)
109             {
110                 v = initValue * Pow2(i);
111                 if (v >= num)
112                 {
113                     return v;
114                 }
115             }
116             return 0;
117         }
118 
119         //2的n次方
120         private int Pow2(int y)
121         {
122             int a = 1;
123             if (y == 0) return 1;
124             else return a << y;
125         }
126     }
127 
128 }