• 2023-03-11leetcode-1389-easy
    CreateTargetArrayintheGivenOrderGiventwoarraysofintegersnumsandindex.Yourtaskistocreatetargetarrayunderthefollowingrules:Initiallyt
  • 2023-02-031389
    #include<iostream>usingnamespacestd;intmain(){ intn; cin>>n; inta; inte=0; for(inti=0;i<n;i++){ cin>>a; e+=a; } floatnum=e; floatg=0.
  • 2023-01-02Codeforces 1389 B. Array Walk 做题记录(DP)
    (纯种的DP还是做得有点苦痛,调了好久。太菜了。)大概就是第一层枚举返回几次,第二层遍历一遍$1~n$。#include<bits/stdc++.h>usingnamespacestd;constintm
  • 2022-10-19POJ 1389. Area of Simple Polygons 题解
    关于扫描线的介绍可以去看OIWiki。但那上面的参考代码并不好,下面给出了带注释的POJ1389题代码。/**Title:AreaofSimplePolygons*Source:POJ*URL:htt
  • 2022-10-17【LeetCode】1389. 按既定顺序创建目标数组(C++)
    1389.按既定顺序创建目标数组(C++)​​1题目描述​​​​2示例描述​​​​2.1示例1​​​​2.2示例2​​​​2.3示例3​​​​3解题提示​​​​4源码详解(C++)​​