示例#1
0
int peekNext()
{
	ScoreTreeNode snode = findMaxScore(score_root);
	if(snode == NULL)
		return -1;
	return snode->head->itemId;
}
示例#2
0
void robot_level2(int level,int *x,int *y,int chess[15][15]){//会进攻了
    int max_score[2];

    findMaxScore(level,max_score,chess);

    *x = max_score[0];
    *y = max_score[1];
    chess[*x][*y] = 10;
}
示例#3
0
int getNext()
{
	ScoreTreeNode snode = findMaxScore(score_root);
	if(snode == NULL)
		return -1;
	int rval;
	rval = snode->head->itemId;
	ItemTreeNode itnode = findItem(snode->head->itemId, item_root);
	int populated = removeItemNode(snode, itnode->item);
	if(!populated)
	{
		score_root = deleteScoreTreeNode(score_root, snode);
	}
	itnode->score = 0;
	ItemNode tmp = itnode->item;
	item_root = deleteItemTreeNode(item_root, itnode);
	deleteItemNode(tmp);

	return rval;
}
示例#4
0
文件: B2.cpp 项目: dasimagin/Algo2016
int main() {
    const std::vector<int> dayLimits = getIntVector(std::cin);
    std::cout.precision(10);
    std::cout << findMaxScore(dayLimits) << std::endl;
    return 0;
}