分割字符串并输出

//1.矩阵链乘
#include<bits/stdc++.h>
#include<sstream>
using namespace std;
const int N=5000;
const int inf=100010;
int M[N][N];
int s[N][N];
int a[N];


void print(int i,int j){
	if(i==j) cout<<"A";
	else{
		cout<<"(";
		print(i,s[i][j]);
		print(s[i][j]+1,j);
		cout<<")";
	}
}

int main(){
	int k=1;
	
	string s,p;
	getline(cin,s);
	
	stringstream ss;
	ss<<s;
	while(ss>>p){
		stringstream ss1;
		ss1<<p;
		ss1>>a[k++];
	}
	
	
	for(int i=1;i<k;i++){
		cout<<a[i]<<" ";
	}
	/*	
	for(int i=1;i<=len-1;i++){
		for(int j=i-1;j>=1;j--){
			M[j][i]=inf;
			int p=inf;
			for(int k=j;k<i;k++){
				p=M[j][k]+M[k+1][i]+a[j]*a[k+1]*a[i+1];
				if(p<M[j][i]){
					M[j][i]=p;
					s[j][i]=k;
				}
			}
		}
	}
	cout<<M[1][len-1]<<endl;
	print(1,len-1);
	
	*/
	return 0;
}

/*
5  10  4  6  10  2
348
*/