Ad Hoc Problems

`Ad hoc' problems are those whose algorithms do not fall into standard categories with well-studied solutions. Each ad hoc problem is different; no specific or general techniques exist to solve them.

Of course, this makes the problems the `fun' ones, since each one presents a new challenge. The solutions might require a novel data structure or an unusual set of loops or conditionals. Sometimes they require special combinations that are rare or at least rarely encountered.

Ad hoc problems usually require careful reading and usually yield to an attack that revolves around carefully sequencing the instructions given in the problem.

Ad hoc problems can still require reasonable optimizations and at least a degree of analysis that enables one to avoid loops nested five deep, for example.

More ad hoc problems appear on this web site than any other kind of problem. Always be ready for an ad hoc problem if you can not classify a problem as one of the other standard types (to be listed later).

=======================

“特定”问题是那些没有标准解决方法的问题,每个问题都是不同的,没有特殊或通用的技巧来解决这些问题。

当然,这也使这些问题非常有趣,因为每个问题都是新的挑战,这些问题的解决方法可能需要特殊的数据结构,或一个不同寻常的循环或条件的集合。有时需要特殊的组合,而且这些组合可能很少见。

对于一个特定问题,你需要很小心地阅读题目,同时也需要合理的最优化。例如,通过一定程度的分析来避免出现五重循环。相比于其他类型的问题,越来越多的特定问题出现在这个网站上。当你无法把一个问题划分为其他任何标准问题时,你就要准备迎接一个特定问题了。

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值