Ⅰ 在ramnode購買vps服務，因為一些原因被定為欺詐行為，如何解決
國外對這種事很敏感，回復都是官方回復，你只能按他們的做，再持續發郵件，提版供她們所需要的證件以權及其他證明，之後只要他們判定你沒有欺詐行為，就會為你開啟伺服器，這個時間會很長，特別是你這種小款項的東西，如果你持續不配合，他們會認定你，覺得你是在逃避，估計以後都不會開啟，更不會退款給你了！
Ⅱ C++編程，，， 各位大神求幫忙啊 ！！！！解決了大大有賞。。 淘寶3個月會員+8元優惠卡+。。。
把下面代碼稍微改下就行了，數值改為0到1，方向改為只有上下左右。
#include<iostream>
#include<list>
#include<queue>
#include<wtypes.h>
usingnamespacestd;
typedefunsignedintuint;
#definenBoard-1
#defineuMaxUint-1
#defineuUnInit-1
uintuMaxX;
uintuMaxY;
uintuMaxCount;
structNode
{
intnX;
intnY;
uintuCount;
};
typedefNode*LPNode;
typedeflist<Node>NodeList;
typedefqueue<POINT>PointQueue;
structRetInfo
{
PointQueuePtQue;
uintuCount;
};
intStep(RetInfo&retInfo,NodeList&lst,int*nMap);
intGetX(intn);
intGetY(intn);
boolIsLoop(NodeList&lst,intnX,intnY);
intRollBack(NodeList&lst);
voidRun(constintn);
intmain()
{
Run(12);
return0;
}
voidRun(constintn)
{
NodeListnodeList;
POINTpt;
Nodenode={1,1,0};
RetInforetInfo;
int*nMap=newint[(n+2)*(n+2)];
uMaxX=uMaxY=n;
LARGE_INTEGERi64Freq;
LARGE_INTEGERi64Start;
LARGE_INTEGERi64End;
QueryPerformanceCounter(&i64Start);
srand(i64Start.LowPart);
for(inti=0;i<=uMaxX+1;i++)
{
for(intj=0;j<=uMaxY+1;j++)
{
if(i==0||i==uMaxX+1||j==0||j==uMaxY+1)
nMap[j*(uMaxX+2)+i]=nBoard;
else
nMap[j*(uMaxX+2)+i]=rand()%9+1;
}
}
nMap[(uMaxX+2)+1]=nMap[uMaxY*(uMaxX+2)+uMaxX]=0;
for(i=1;i<=uMaxY;i++)
{
for(intj=1;j<=uMaxX;j++)
{
cout<<nMap[i*(uMaxX+2)+j]<<'';
}
cout<<' ';
}
uMaxCount=uMaxUint;
nodeList.push_back(node);
QueryPerformanceFrequency(&i64Freq);
QueryPerformanceCounter(&i64Start);
Step(retInfo,nodeList,nMap);
delete[]nMap;
QueryPerformanceCounter(&i64End);
printf("%d.T:%.2lfms ",n,(double)(i64End.QuadPart-i64Start.QuadPart)*1000/i64Freq.QuadPart);
cout<<"MinCount="<<retInfo.uCount<<endl;
while(!retInfo.PtQue.empty())
{
pt=retInfo.PtQue.front();
cout<<"("<<pt.x<<","<<pt.y<<")"<<endl;
retInfo.PtQue.pop();
}
}
intStep(RetInfo&retInfo,NodeList&lst,int*nMap)
{
LPNodelpNode=&lst.back();
if(lpNode->nX==uMaxX&&lpNode->nY==uMaxY&&lpNode->uCount<uMaxCount)
{
returnlpNode->uCount;
}
for(inti=0;i<8;i++)
{
intx=lpNode->nX+GetX(i);
inty=lpNode->nY+GetY(i);
uintuCount=lpNode->uCount+nMap[y*(uMaxX+2)+x];
if(nMap[y*(uMaxX+2)+x]!=nBoard&&uCount<uMaxCount&&!IsLoop(lst,x,y))
{
Nodenode={x,y,uCount};
//cout<<"->("<<lpNode->nX<<","<<lpNode->nY<<")"<<endl;
lst.push_back(node);
if(Step(retInfo,lst,nMap)!=uUnInit)
{
uMaxCount=retInfo.uCount=uCount;
//cout<<uCount<<endl;
while(!retInfo.PtQue.empty())
retInfo.PtQue.pop();
for(NodeList::iteratorit=lst.begin();it!=lst.end();it++)
{
POINTpt={it->nX,it->nY};
retInfo.PtQue.push(pt);
}
}
intnRet=RollBack(lst);
if(nRet!=uUnInit)
{
i=nRet;
lpNode=&lst.back();
continue;
}
else
{
break;
}
}
}
returnuUnInit;
}
intGetX(intn)
{
conststaticintnX[8]={1,0,1,-1,1,-1,0,-1};
returnnX[n];
}
intGetY(intn)
{
conststaticintnY[8]={1,1,0,1,-1,0,-1,-1};
returnnY[n];
}
intGetN(intnX,intnY)
{
intn[9]={7,5,3,6,-1,1,4,2,0};
returnn[++nX*3+++nY];
}
boolIsLoop(NodeList&lst,intnX,intnY)
{
NodeList::iteratorit=lst.begin();
while(it!=lst.end())
{
if(it->nX==nX&&it->nY==nY)
returntrue;
it++;
}
returnfalse;
}
intRollBack(NodeList&lst)
{
if(lst.size()<2)
returnuUnInit;
Nodenode=lst.back();
//cout<<"<-("<<node.nX<<","<<node.nY<<"),"<<lst.size()<<","<<node.uCount<<endl;
lst.pop_back();
Node&last=lst.back();
intx=node.nX-last.nX;
inty=node.nY-last.nY;
returnGetN(x,y);
}