《算法导论》思考题15-2 整齐打印

#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>

#define MAX_VAL 999999

using namespace std;

int g_iLast=0;
int g_iLimit=MAX_VAL;
int g_iLen=0;
vector<int> g_vecOp;  ////optimal amount for weight
vector<string> g_vecWord; ////////Storing the words
vector<int> g_vecIndex;

int space(int index){
	////////// index>=1
	int total=g_iLimit;
	for(int i=1;i<=g_iLen;i++){
		if(g_vecIndex[i]==index){
			total-=g_vecWord[i-1].size();
			total--;
		}
	}
	return total;////// A bug!
}

int space(int i,int j){
	/////// 1<=i<=j<=len
	int total=0;
	for(int x=i;x<=j;x++){
		total+=g_vecWord[x-1].size();
	}
	return g_iLimit-j+i-total;
}


void optimal(){
	int iCur=1;
	for(int i=1;i<=g_iLen;i++){
		////// Descend Order to Save More Time
		g_vecOp[i]=MAX_VAL;
		int iSpace=space(iCur);
		int iSize=g_vecWord[i-1].size();
		if(iSpace>=iSize){
			//////// The Space Enough to append
			g_vecIndex[i]=iCur;
			g_vecOp[i]=g_iLast+(iSpace-iSize)*(iSpace-iSize)*(iSpace-iSize);

		}else{
			/////// If Not
			iCur++;
			g_iLast=g_vecOp[i-1];
			int min=MAX_VAL;
			for(int j=i;j>1;j--){
				int s=space(j,i);
				if(s<0)break;
				int temp=g_vecOp[j-1]+s*s*s;
				if(min>temp){
					min=temp;
					for(int m=j;m<=i;m++){
						g_vecIndex[m]=iCur;
					}
				}
			}g_vecOp[i]=min;
			g_vecIndex[i]=iCur;
		}
	}
	cout<<"The cubic minimum of blank is "<<g_vecOp[g_iLen]<<endl<<endl;
}







int main(){
	cout<<"Input the total amount of your Word: "<<ends;
	cin>>g_iLen;
	///////////////////////
	string szTmp;
	for(int i=0;i<g_iLen;i++){
		cin>>szTmp;
		g_vecWord.push_back(szTmp);
	}
	///////////////////////
	cout<<"Input your maximun digits of letters allowed in a line :"<<ends;
	cin>>g_iLimit;
	for(int i=0;i<=g_iLen;i++){
		g_vecOp.push_back(0);
		g_vecIndex.push_back(0);
	}
	/////////////////////// Initializing Complete

	optimal();
	//////////////////////Outputting
	int now=1;
	for(int i=1;i<=g_iLen;i++){
		if(g_vecIndex[i]>now){
			now++;
			cout<<endl<<g_vecWord[i-1]<<‘ ‘<<ends;
		}else{
			cout<<g_vecWord[i-1]<<‘ ‘<<ends;
		}
	}
	return 0;
}