Case vs Perform i Of

最新推荐文章于 2023-08-06 01:48:20 发布
最新推荐文章于 2023-08-06 01:48:20 发布
阅读量705 收藏
点赞数
分类专栏： SAP ABAP Optimize
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Gangelwn/article/details/6281573
版权

*  (I = 5 in this test)
 CASE I.
  WHEN 1. PERFORM PV1.
  WHEN 2. PERFORM PV2.
  WHEN 3. PERFORM PV3.
  WHEN 4. PERFORM PV4.
  WHEN 5. PERFORM PV5.
  WHEN 6. PERFORM PV6.
  WHEN 7. PERFORM PV7.
  WHEN 8. PERFORM PV8.
 ENDCASE.

 


*  (I = 5 in this test)
 PERFORM I OF
             PV1
             PV2
             PV3
             PV4
             PV5
             PV6
             PV7
             PV8.

 

 

Documentation
A very fast way to call a certain routine using a given
index is the Perform i Of ... statement.

Gangelwn
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
ABAP 内表的定义，与PERFORM传值的定义
寒武青锋的博客
06-08 9374
问题描述： 许多同学在内表定义还有很多种，其实掌握两种就好了；DATA的用法那么多，该怎么用？还有就是PERFORM创建之后，传值有什么讲究，老是参考定义不对劲。 此博客就是解决这两个问题 一,普通程序需要定义结构 1.全手动定义的结构 TYPES : BEGIN OF typ_alv , aufnr TYPE afpo-aufnr, "生产订单 auart TYPE aufk-auart, "订单类型 mes TYPE cha
Worst Case Circuit Analysis Application Guidelines
liugaoxingliushi的专栏
11-15 2744
Worst Case Circuit Analysis (WCCA) wcca.pdf (les-electroniciens.com)
A. Case of Matryoshkas
无知的我
07-22 1157
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Andrewid the Android is a galaxy-famous detective. He is now inv
Cadence IRUN仿真编译选项
GloriaHuo's Blogs
01-08 1万+
IRUN仿真编译选项 1. 仿真编译选项 -64bit Invoke 64bit version -a_ext <ext> Override extensions for archive files -abv2copt Enable optimization on 2 cycle assertions -abvcoveron Enable cover
Perform the Combo 简单题解
佯设的博客
02-27 7020
题目来源：Problem - 1311C - Codeforces 原题： time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You want to perform the combo on your opponent in one popular fighting game. The combo is the str.
SAP DOI实现小记
忍&拼
09-01 4676
SAP DOI实现小记，主要是简单记录实现步骤
Proof of Stake FAQ
热门推荐
跨链技术践行者
03-26 1万+
Contents What is Proof of Stake What are the benefits of proof of stake as opposed to proof of work? How does proof of stake fit into traditional Byzantine fault tolerance research? What is the "n...
Introduction to Programming I
Yousazoe
10-19 7340
Keyclack posters by Mohamed Chahin Acquire fundamental elements of programming languages. Topic # 1 Getting Started As an introduction to programming, you will learn basic structures, variables, input/output, and computati...
i2cget 用法说明
大余里，大余的干货分享
11-23 6207
NAME i2cget - read from I2C/SMBus chip registers SYNOPSIS i2cget[-f] [-y] [-a]i2cbuschip-address[data-address[mode]]i2cget-V DESCRIPTION i2cget is a small helper program to read registers visible through the I2C bus (or SMBus). OPTIONS -V Dis...
Machine Learning Engineering Case Studies with Python notebook
最新发布
禅与计算机程序设计艺术
08-06 1156
作者：禅与计算机程序设计艺术Machine learning engineering (MLE) is the process of developing machine learning systems that can perform tasks with high accuracy and efficiency at scale. MLE involves designing, building, testing, deploying, monitoring, and maintaining mach
Typed vs untyped Parameters
Gangelwn
03-27 1097
<br />Untyped parameters <br />Runtime: 5 microseconds <br />PERFORM UP1 USING 10 M6-DIMID M6-ZAEHL M6-ISOCODE M6-ANDEC M6-PRIMARY.<br />FORM UP1 USING<br />               REPEAT<br />               DIMID<br />               ZAEHL<br />               ISOCO
Intersection of internal tables
Gangelwn
03-27 1045
<br />Using a sorted table temporarily <br />Runtime: 101 microseconds <br /><br />* Entries: 200 (ITAB1), 100 (ITAB2)<br />* Intersection: 50 (ITAB3)<br />* Line width: 100, Key width: 20<br />STAB1 = ITAB1.<br />REFRESH ITAB3.<br />LOOP AT ITAB2 ASSIGNIN
Modifying a set of lines directly
Gangelwn
03-27 879
<br /><br />Modifying all lines completely <br />* Entries: 100 (outer table), 20 (inner table)<br />* The entries to be modified: 50<br />* Actually, only the component FLAG is updated.<br />* However, the complete lines are moved.<br />LOOP AT ITAB INTO
Single Read Sorted vs hashed tables
Gangelwn
03-27 859
<br />READ on a unique sorted table <br />* Entries: 1000<br />* Line width: 100, key width: 20<br />* STAB is a unique sorted table, 250 entries are read<br />DO 250 TIMES.<br />  N = 4 * SY-INDEX.<br />  READ TABLE STAB INTO WA WITH TABLE KEY K = N.<br /
Building unique sorted hashed tables.
Gangelwn
03-27 849
<br />INSERT in a sorted table with unique key <br /><br />* Entries: 1000, Duplicates: 250<br />* Line width: 100, Key width: 20<br />* ITAB2 takes 750 entries with unique key K<br />REFRESH ITAB2.<br />LOOP AT ITAB1 INTO WA.<br />  INSERT WA INTO TABLE I
Supply Demand vs select
Gangelwn
03-27 837
<br />SELECT:<br /> <br />SELECT * FROM SBOOK INTO SBOOK_WA UP TO 10 ROWS.<br />  SELECT SINGLE AIRPFROM AIRPTO INTO (AP1, AP2)<br />         FROM  SPFLI<br />         WHERE CARRID = SBOOK_WA-CARRID<br />         AND   CONNID = SBOOK_WA-CONNID.<br />  SELE
用C++写There are n folders in a computer, indexed from 1 to n . The folder indexed 1 is the root folder, and each folder may contain several subfolders, forming a tree structure. You can perform several "cut" operations, each cutting a source folder into a target folder. Note that the target folder cannot be the same as the source folder, nor can it be the source folder's subfolder, subfolder's subfolder, and so on. Obviously, the root folder cannot be cut, and it will always be the root folder. Find out that at least how many "cut" operations should be performed so that each folder contains at most one subfolder. Input The first line contains a single integer n (1≤n≤105) — the number of folders. The second line of each test case contains n−1 space separated integers p2,p3,⋯,pn (1≤pi≤n) — pi represents the index of the parent folder of folder i . Output Output the minimum number of "cut" operations performed. Note that there may not be a need to perform "cut" operation. Please output 0 in this case.
05-26
以下是使用 C++ 解决该问题的代码： ```cpp #include <iostream> #include <vector> using namespace std; const int MAXN = 1e5 + 5; vector<int> G[MAXN]; int ans; void dfs(int u, int fa) { int cnt = 0; for (int v : G[u]) { if (v == fa) continue; dfs(v, u); cnt++; } ans += max(cnt - 1, 0); } int main() { int n; cin >> n; for (int i = 2; i <= n; i++) { int x; cin >> x; G[x].push_back(i); } dfs(1, 0); cout << ans << endl; return 0; } ``` 该问题可以用一个简单的 DFS 解决。我们首先读入每个节点的父亲节点，然后建立一棵树。对于每个节点，我们统计它的子节点个数，记为 $cnt$。如果 $cnt \geq 2$，则需要将其中的 $cnt - 1$ 个子节点切断，使得每个节点最多只有一个子节点。因此，我们在 DFS 的过程中累加所有需要切断的次数，最终输出即可。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值