UVA_11157_Dynamic Frog

9 篇文章 0 订阅
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#pragma warning(disable:4996)
#include<cstdio>
#include<cstdlib>
using std::cin;
using std::cout;
using std::endl;
using std::stringstream;
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::set;
using std::multiset;
using std::map;
using std::multimap;
using std::stack;
using std::queue;
using std::priority_queue;
int maxi_distance_small_rock(const vector<int>&rock)
{
	int maximum = 0;
	for (size_t i = 0; i < rock.size() - 1; i++)
	{
		maximum = std::max(maximum, rock[i + 1] - rock[i]);
	}
	return maximum;
}
int mini_distance_big_rock(const int &left,const int &right,const vector<int>&rock)//求两座大石头之间的最短距离,rock表示小石头的坐标
{
	//把小石头拆成奇偶两部分
	vector<int>odd{ left }, even{ left };
	for (size_t i = 0; i != rock.size(); i++)
	{
		if (i % 2 == 0)
		{
			odd.push_back(rock[i]);
		}
		else
		{
			even.push_back(rock[i]);
		}
	}
	odd.push_back(right); 
	even.push_back(right);
	return std::max(maxi_distance_small_rock(odd), maxi_distance_small_rock(even));
}
int main()
{
	//freopen("input.txt", "r", stdin);  
	//freopen("output.txt", "w", stdout);  
	int T,count=0;
	while (cin >> T)
	{
		while (T--)
		{
			int n, distance;
			//最大过河距离为河的宽度
			int minimum = 0;
			cin >> n >> distance;
			int curpos = 0;
			vector<int>small;
			for (int i = 0; i < n; i++)
			{
				char rock, dash; int nextpos;
				cin >> rock >> dash >> nextpos;
				if (rock == 'B')
				{
					auto curdistance = mini_distance_big_rock(curpos, nextpos, small);
					minimum = std::max(minimum, curdistance);
					small.clear();
					curpos = nextpos;
				}
				else
				{
					small.push_back(nextpos);
				}
			}
			auto curdistance = mini_distance_big_rock(curpos, distance, small);
			minimum = std::max(minimum, curdistance);
			cout << "Case " << ++count << ": "<<minimum << endl;
		}
	}
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
逐句解释下列代码: %% 蛙跳算法全局参数设置 FROG_NUM=20; % 青蛙种群的个体数目 GROUP_NUM = 4; % 青蛙种群的分组个数 FROG_IN_GROUP = 5; % 组内青蛙个数 MAX_ITERATION_NUM = 1000; % 最大迭代次数 CHARACTER_NUM = length(traind(1,:)); % 初始特征集的总维度 % SUBCHARACTER_NUM = 5; % REPET_NUM = 100; # 重复次数,如果加上这个参数,将停止条件增加为结果重复REPET_NUM停止迭代 tic; %% 蛙跳算法初始化 %---------init------------% for i=1:FROG_NUM a=randperm(CHARACTER_NUM); allfrog(i).pos=a(1:SUBCHARACTER_NUM); allfrog(i).eva=evaluation(traind,label,allfrog(i).pos); end %----------sort-----------% [evatemp,index]=sort([allfrog.eva],'descend'); %% 迭代寻优 count=1; iter=1; eva = []; while iter<MAX_ITERATION_NUM+1 % while count<REPET_NUM %----------group----------% k=1; for j=1:FROG_IN_GROUP for i=1:GROUP_NUM grouped(i,j)=allfrog(index(k)); k=k+1; end end %---------find_max--------% global_max=allfrog(index(1)); for i=1:GROUP_NUM max_in_group(i)=grouped(i,1); min_in_group(i)=grouped(i,FROG_IN_GROUP); end %----------update------------% for i=1:GROUP_NUM frogtemp=min_in_group(i); frogtemp.pos=updated(frogtemp.pos,max_in_group(i).pos); frogtemp.eva=evaluation(traind,label,frogtemp.pos); if frogtemp.eva>min_in_group(i).eva grouped(i,FROG_IN_GROUP)=frogtemp; else frogtemp=min_in_group(i); frogtemp.pos=updated(frogtemp.pos,global_max.pos); frogtemp.eva=evaluation(traind,label,frogtemp.pos); if frogtemp.eva>min_in_group(i).eva grouped(i,FROG_IN_GROUP)=frogtemp; else a=randperm(CHARACTER_NUM); frogtemp.pos=a(1:SUBCHARACTER_NUM); frogtemp.eva=evaluation(traind,label,frogtemp.pos); grouped(i,FROG_IN_GROUP)=frogtemp; end end end %--------------混洗---------------% k=1; for i=1:FROG_IN_GROUP for j=1:GROUP_NUM allfrog(k)=grouped(j,i); k=k+1; end end eva = [eva global_max.eva]; iter=iter+1; [evatemp,index]=sort([allfrog.eva],'descend'); global_max_new=allfrog(index(1)); if global_max_new.eva>global_max.eva count=0; else count=count+1; end % end end % fprintf('iteration:%d\n',iter); % global_max=allfrog(index(1)); % fprintf('global_max.eva:%f\n',global_max.eva); % fprintf('global_max.pos:'); % fprintf('%d\t',global_max.pos); % fprintf('\n'); t = toc; end
最新发布
05-15

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值