动态规划——图像压缩算法

#include <iostream>
#include <string>
#include<cstdio>
#include<algorithm>
using namespace std;
//计算像素的位数b[i]
int centbits(int number){
    int sum = 1;
    number = number / 2;
    while(number > 0){
        sum++;
        number = number / 2;
    }
    return sum;
}
//计算数组p【】下标从first 到 last的最大位数是多少
int cent_max_bits(int p[],int first,int last){
    int maxNumber = 0;
    for(int i = first;i < last;i++){
        maxNumber = centbits(p[i]) > maxNumber ? centbits(p[i]) : maxNumber;
    }
    return maxNumber;
}
void outPutArray(string s,int i){
    cout<<s<<"["<<i<<"]"<<"=";
}
void outPutArrayList(int *p,int n){
    cout<<"p = {";
    for(int i = 0;i<n;i++){
        cout<<p[i];
        if(i != n-1){
            cout<<",";
        }
    }
    cout<<"}"<<endl;;
}

int main()
{
    int p[6] = {10,12,15,255,1,2};
    int n = sizeof(p)/sizeof(int);
    //cout<<n<<endl;
    outPutArrayList(p,n);
    int i,j;
    int length[100];
    int bits[100];
    int s[100];
    int m[100]={0};
    /*length[i]存放第i段长度。（L:length）
    bits[i]存放第i段中像素的位数。（B:bits）
    P[i]{P1，P2，···Pn²}以变长格式存储二进制串。*/
    //压缩公式：length[i]*bits[i]+11*m
    int tmp;
    int max_bit;
    s[0] = 0;
    s[1] = cent_max_bits(p,0,1)+11;//b[1]*l[1]+11
    int min_number = 999;
    for(i = 2;i <= n;i++){//分成多少段s[i]段,i = n时，取数列前n个,从i= 2开始，分成2段，取前2个
        outPutArray("s",i);
        cout<<"min{";
        for(j = 0;j < i;j++){
            length[i] = i-j;//存放第i段长度
            max_bit = cent_max_bits(p,j,i);//计算取前i个时最大位数b[i]是多少
            bits[i] = max_bit;
            tmp = s[j] + length[i]*bits[i]+11;//s[i]+l[i]*b[i]+11;
            cout<<"s["<<j<<"]+length["<<length[i]<<"]*bits["<<bits[i]<<"]+11";
            cout<<"|||"<<s[j]+length[i]*bits[i]+11<<"|||";//输出该段压缩空间的值
            if(j != i-1){
                cout<<",";
            }
            if(min_number >= tmp){
                min_number = tmp;
                m[i] = j;
            }
        }
        cout<<"}=";
        s[i] = min_number;
        cout<<s[i]<<endl;
        cout<<endl;
        min_number = 999;
    }
    cout<<"zui xiao kong jian:"<<s[n]<<endl;
    /*for(i = 1;i<=n;i++){
        cout<<m[i]<<" ";
    }*/
    cout<<endl;

    //输出像素分段
    int num = 0;
    for(i = 1;i < n;i++){
        if(m[i+1]-m[i] != 0){
            cout<<"di yi duan de xiang su ge shu wei : "<<m[i+1]-m[i]<<"     mei ge xiang su de cun chu shu wei :"<<cent_max_bits(p,num,i-1)<<endl;
            num = i-1;
        }
    }
     cout<<"di yi duan de xiang su ge shu wei : "<<n-m[n]<<"     mei ge xiang su de cun chu shu wei :"<<cent_max_bits(p,num,n)<<endl;
    cout<<"shu chu xu lie:"<<endl;
    //输出最优分段
    int flag=-1;
    int t1 = 1;
    for(i = 1;i <6;i++){
        int account = m[i+1]-m[i];

        while(account--){
                if(t1){
                    cout<<"<";
                    t1 = 0;
                }
                flag++;
                cout<<p[flag];
                if(account == 0){
                    cout<<">";
                    t1 = 1;
                }else{
                    cout<<",";
                }
        }
    }
    cout<<"<";
    for(i = m[n];i<n;i++){
        cout<<p[i];
        if(i != n-1){
            cout<<",";
        }
    }
    cout<<">";


}