----离线
文章平均质量分 84
_Occult_
物語が始まった
展开
-
HDU 5200 Trees
Problem Description Today CodeFamer is going to cut trees.There are N trees standing in a line. They are numbered from 1 to N. The tree numbered i has height hi. We say that two uncutted tr原创 2015-04-05 01:33:06 · 500 阅读 · 0 评论 -
HDU 4605 Magic Ball Game
Font Size: ← → Problem Description When the magic ball game turns up, Kimi immediately falls in it. The interesting game is made up of N balls, each with a weight of w[i]. These N balls form a r原创 2015-05-13 15:17:42 · 553 阅读 · 0 评论 -
FZU 2226 信心题
Problem Description 给定一个含有n个数字的数列,每个数字都有一个值a[i](下标从1开始)。定义第i个数字和第j个数字间的距离dis(i,j)=abs(i-j)。 接下来给出q个询问,每次询问一个区间[l,r],要求求出一对数字(i,j)(l Input 题目包含多组数据 每组数据第一行一个数n 第二行n个数字,表示数列a 第三行一个数字q,表示询问原创 2016-04-17 19:52:30 · 984 阅读 · 0 评论