360在线笔试编程题2018

#include<iostream>
#include<vector>
using namespace std;
bool check(int *color, int pos, int start, int end)
{
for(int i=start;i<=end;i++){
if(*(color+i)==*(color+pos)){
return true;
}
}
return false;
}
int findsame(int *color, int pos ,int len)
{
int i=1;
while((pos+i)<len&&*(color+pos)!=*(color+pos+i)){
i++;
}
return pos+i;
}
unsigned int getMaxCut(int *color, int len)
{
unsigned int **p;
p = new unsigned int * [len];
for(int i=0;i<len;i++)
{
p[i] = new unsigned int[len];
for(int j=0;j<len;j++)
{
if(i==j){
p[i][j]=1;
}else{
p[i][j] = 0;
}
}
}
for(int k=2;k<=len;k++)
{
for(int j=0;j<len-k+1;j++)
{
if(check(color,j,j+1,j+k-1))
{
int same=findsame(color,j,len);
if(same-1!=j){
p[j][j+k-1]=p[j+1][same-1]*p[same][j+k-1]*4-1;
}else{
p[j][j+k-1]=p[same][j+k-1];
}
}else
{
p[j][j+k-1]=2*p[j+1][j+k-1];
}
}
}

return p[0][len-1];

}
int main()
{
int len;
cin>>len;
int *color = new int[len];
for(int i=0;i<len;i++)
cin>>*(color+i);
cout<<getMaxCut(color,len)<<endl;
return 1;
}