resource_variation.java~43~

这个是朋友作的毕业设计

package Resource_Selection;

import java.util.*;

public class resource_variation {
    classad classad = new classad();
    Random rd=new Random();
    rank rank=new rank();
    int rdget=0;
    int i=0,j=0;
    int lv=0;
    int father;
    int xch;
    int temp[][]=new int[20][20];
    int ra[]=new int[20];
    public void resource_variation(int a[][],int m, int n,classad que[]){
      while (i<5){
           rdget = Math.abs(rd.nextInt()) % n;
          if(rank.rank(a,rdget,que,n) > lv) {
           lv=rank.rank(a,rdget,que,n);
           father = rdget;
           }
           i++;
         }
      rdget = Math.abs(rd.nextInt()) % 3 + 1;
      switch (rdget)
      {
        case 1:
                   rdget = Math.abs(rd.nextInt()) %100 +1;
                 int start=(rdget-1)*n/100,end=rdget*n/100;
                 if(start>end){
                   xch=start;
                   start=end;
                   end=start;
                 }
                 for (i=0;i<n;i++)
                 {
                   temp[0][i]=a[father][i];
                 }
                 for (i=start;i<end;i++)
                 {
                   temp[0][i]=~a[father][i];
                 }

        case 2:

          for (i=0;i<4;i++){
            ra[i] = Math.abs(rd.nextInt()) % n;
          }
          for(i=0;i<4;i++){
            for(j=0;j<4;j++){
              if(ra[i]>ra[j]){
                xch=ra[i];
                ra[i]=ra[j];
                ra[j]=xch;
              }
            }
          }
          j=0;
          for(i=0;i<ra[0];i++){
            temp[0][j]=a[father][i];
            j++;
          }
          for(i=ra[2];i<ra[3];i++){
            temp[0][j]=a[father][i];
            j++;
          }
          for(i=ra[1];i<ra[2];i++){
            temp[0][j]=a[father][i];
            j++;
          }
          for(i=ra[0];i<ra[1];i++){
            temp[0][j]=a[father][i];
            j++;
          }
          for(i=ra[0];i<ra[1];i++){
            temp[0][j]=a[father][i];
            j++;
          }
          for(i=ra[3];i<n;i++){
            temp[0][j]=a[father][i];
            j++;
          }

        case 3:
          while(ra[0]==ra[1]){
            for (i = 0; i < 2; i++) {
              ra[i] = Math.abs(rd.nextInt()) % n;
            }
          }
            if(ra[0]>ra[1]){
              xch=ra[0];
              ra[0]=ra[1];
              ra[1]=xch;
            }
            j=0;
            for(i=0;i<ra[0];i++){
              temp[0][j]=a[father][i];
              j++;
            }
            for(i=ra[0];i<ra[1];i++){
              temp[0][j]=a[father][ra[0]];
              j++;
            }
            for(i=ra[1];i<n;i++){
              temp[0][j]=a[father][i];
              j++;
            }
      }

      int min=rank.rank(a,0,que,n),min_no=0;
      while (i<m){
        int c=rank.rank(a,i,que,n);
        if (c<min){
           min=c;
           min_no=i;
         }
         i++;
       }
         if (rank.rank(temp,0,que,n)>min) {
           for (i = 0; i < n; i++) {
             a[min_no][i] = temp[0][i];
           }
         }
  }

}