首页 > TAG信息列表 > ALDS1
【Aizu ALDS1_1_D --- Maximum Profit】
【Aizu ALDS1_1_D --- Maximum Profit】 Description You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108有根树的表达 Aizu - ALDS1_7_A: Rooted Trees
有根树的表达 题目：Rooted Trees Aizu - ALDS1_7_A A graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs). Fig. 1搜索的应用--计算最优解：Aizu - ALDS1_4_D Allocation
搜索的应用-计算最优解 题目： You are given nn packages of wiwi kg from a belt conveyor in order (i=0,1,...n−1i=0,1,...n−1). You should load all packages onto kk trucks which have the common maximum load PP. Each truck can load consecutive packages (more[Aizu] ALDS1_14_B: String Search[续]
目录 题目 描述 输入 输出 限制条件 样例输入1 样例输出1 样例输入2 样例输出2 样例输入3 样例输出3 求解 分析 设计 编码 结果 总结 题目 传送门: ALDS1_14_B: String Search 描述 寻找字符串P在一个文本T中出现的位置, 输出所有在T中找到的P的索引, T的索引从0开始. 输Linear Search Aizu - ALDS1_4_A
Search I You are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S. Input In the first line n is given. In the second line, n integers are gi