ORDER BY 的时候不能在select 句子中用sequence

本文提供了一个复杂的SQL查询示例,用于从多个表中选择特定条件的数据,并通过联接操作来确保数据的一致性和准确性。该查询展示了如何使用子查询、连接条件以及排除已存在的记录。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

SELECT seq_com_id.NEXTVAL delta_id,XX.* FROM (
   SELECT 
    'EXT' delta_type, NULL paper_no,
            'D10041' err_cd, 'SYSTEM' created_by, SYSDATE created_dt,
            'SYSTEM' updated_by, SYSDATE updated_dt, NULL deleted_by,
            NULL deleted_dt, 1 VERSION, x.exam_yr, x.exam_lvl_cd,
            x.exam_series_cd, x.index_no, x.subj_cd
       FROM (SELECT DISTINCT a.exam_yr, a.exam_lvl_cd, a.exam_series_cd,
                             a.index_no, a.uin, a.reg_stat_nm, a.dob,
                             b.subj_cd
                        FROM xe_rp_cddt_reg a,
                             xe_cddt_posting_paper b,
                             xe_subj_configuration c
                       WHERE a.exam_yr = 2008
                         AND a.exam_lvl_cd = 'GCEA'
                         AND a.exam_series_cd = 'YE'
                         AND (a.reg_st = 'N' OR a.reg_st = 'R')
                         AND a.cddt_reg_id = b.cddt_reg_id
                         AND a.exam_yr = b.exam_yr
                         AND a.exam_lvl_cd = b.exam_lvl_cd
                         AND a.exam_series_cd = b.exam_series_cd
                         AND a.exam_yr = c.exam_yr
                         AND a.exam_lvl_cd = c.exam_lvl_cd
                         AND a.exam_series_cd = c.exam_series_cd
                         AND b.subj_cd = c.subj_cd
                         AND b.lang_med_cd = c.lang_med_cd
                         AND (    c.examining_agency_cd <> 'CAMB'
                              AND c.examining_agency_cd <> 'SPORE'
                             )) x
      WHERE NOT EXISTS (
               SELECT *
                 FROM xe_rp_ext_result y
                WHERE y.exam_yr = x.exam_yr
                  AND y.exam_lvl_cd = x.exam_lvl_cd
                  AND y.uin = x.uin
                  AND y.subj_cd = x.subj_cd)
   ORDER BY uin
   ) XX

B. Serval and Final MEX time limit per test1 second memory limit per test256 megabytes You are given an array a consisting of n≥4 non-negative integers. You need to perform the following operation on a until its length becomes 1 : Select two indices l and r (1≤l<r≤|a| ), and replace the subarray [al,al+1,…,ar] with a single integer mex([al,al+1,…,ar]) , where mex(b) denotes the minimum excluded (MEX)∗ of the integers in b . In other words, let x=mex([al,al+1,…,ar]) , the array a will become [a1,a2,…,al−1,x,ar+1,ar+2,…,a|a|] . Note that the length of a decreases by (r−l) after this operation. Serval wants the final element in a to be 0 . Help him! More formally, you have to find a sequence of operations, such that after performing these operations in order, the length of a becomes 1 , and the final element in a is 0 . It can be shown that at least one valid operation sequence exists under the constraints of the problem, and the length of any valid operation sequence does not exceed n . Note that you do not need to minimize the number of operations. ∗ The minimum excluded (MEX) of a collection of integers b1,b2,…,bk is defined as the smallest non-negative integer x which does not occur in the collection b . Input Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤1000 ). The description of the test cases follows. The first line of each test case contains a single integer n (4≤n≤5000 ) — the length of the array a . The second line contains n integers a1,a2,…,an (0≤ai≤n ) — the elements of the array a . It is guaranteed that the sum of n over all test cases does not exceed 5000 . Output For each test case, output a single integer k (0≤k≤n ) in the first line of output — the length of the operation sequence. Then, output k lines, the i -th line containing two integers li and ri (1≤li<ri≤|a| ) — the two indices you choose in the i -th operation, where |a| denotes the length of the array be
最新发布
03-23
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值