A10354 | Fibonacci-ish
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Yash has recently learnt about the Fibonacci sequence and is very excited about it. He calls a sequence Fibonacci-ish if
1. the sequence consists of at least two elements
2. $f_{0}$ and $f_{1}$ are arbitrary
3. $f_{n+2}=f_{n+1}+f_{n}$ for all $n>=0$ .
You are given some sequence of integers $a_{1},a_{2},...,a_{n}$ . Your task is rearrange elements of this sequence in such a way that its longest possible prefix is Fibonacci-ish sequence.
1. the sequence consists of at least two elements
2. $f_{0}$ and $f_{1}$ are arbitrary
3. $f_{n+2}=f_{n+1}+f_{n}$ for all $n>=0$ .
You are given some sequence of integers $a_{1},a_{2},...,a_{n}$ . Your task is rearrange elements of this sequence in such a way that its longest possible prefix is Fibonacci-ish sequence.
输入格式
The first line of the input contains a single integer $n$ ( $2<=n<=1000$ ) — the length of the sequence $a_{i}$ .
The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $|a_{i}|<=10^{9}$ ).
The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $|a_{i}|<=10^{9}$ ).
输出格式
Print the length of the longest possible Fibonacci-ish prefix of the given sequence after rearrangement.
输入输出样例
输入 #1
3 1 2 -1
输出 #1
3
输入 #2
5 28 35 7 14 21
输出 #2
4
In the first sample, if we rearrange elements of the sequence as $-1$ , $2$ , $1$ , the whole sequence $a_{i}$ would be Fibonacci-ish.
In the second sample, the optimal way to rearrange elements is , , , , $28$ .
In the second sample, the optimal way to rearrange elements is , , , , $28$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted