NUAA ACM As_We_Can

Genral

=========

Team AsWeCan from Nanjing University of Aeronautics and Astronautics.

• 2017.5.14 JSCPC : Gold (10th place)

• 2017.10.29 CCPC Qinhuangdao: Bronze (115th place)

• 2017.11.19 ICPC Beijing: Bronze (96th place)

• 2017.11.20 Dissolved.

Todolist

==========

• …

Training

==========

Lixiang

• 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest(October 30th&31st)
  
  • A Automatic Door(数学)
  • B Berland Army
  • C Downloading B++
  • D Packmen Strike Back
  • E Field of Wonders(状态压缩)
  • F Lost in Transliteration (字符串hash)
  • G Orientation of Edges(dfs序)
  • H Palindromic Cut(搜索剪枝)
  • I Photo Processing(dp)
  • J Renovation
  • K Road Widening(递推)
  • L Berland.Taxi
  • M Quadcopter Competition(水题)

• The 2017 China Collegiate Programming Contest, Qinhuangdao Site(November 1st&2nd&3rd)

  • A Balloon Robot(递推)
  • B Expected Waiting Time(Catalan数)
  • C Crusaders Quest
  • D Graph Generator
  • E String of CCPC(贪心)
  • F Getting Lost
  • G Numbers(贪心+高精度)
  • H Prime Set(带花树)
  • I Triangulation
  • J Tree Equation
  • K Diversity and Variance
  • L One-Dimensional Maze(水题)
  • M Safest Buildings(水题)

• 2017中国大学生程序设计竞赛 - 网络选拔赛(November 6th&7th&8th)

  • A Vertex Cover(构造)
  • B Party
  • C Friend-Graph(水题)
  • D A Secret(KMP)
  • E CaoHaha's staff(数学)
  • F Subsequence Count
  • G Palindrome Function(数位DP)
  • H The Karting
  • I The Designer
  • J Graph Of Zhuper
  • K Convolution Layer

• The 2016 ACM-ICPC Asia Beijing Regional Contest(November 9th&10th&11th)

  • A Harmonic Matrix Counter
  • B Binary Tree
  • C Asa’s Chess Problem
  • D What a Beautiful Lake(水题)
  • E What a Ridiculous Election(BFS)
  • F What a Simple Research(水题)
  • G A Triangle Puzzle
  • H A New Ground Heating Device
  • I A Boring Problem(数学)
  • J Parrot
  • K JiLi Number(打表)
• 2015-2016 ACM-ICPC Northeastern European Regional Contest (NEERC 15)(November 12th&13th&14th)
  
  • A Adjustment Office(水题)
  • B Binary vs Decimal
  • C Cactus Jubilee
  • D Distance on Triangulation
  • E Easy Problemset(模拟)
  • F Froggy Ford(DP)
  • G Generators(简单的同余)
  • H Hypercube
  • I Iceburg Orders
  • J Jump(有意思的交互题)
  • K King’s Inspection
  • L Landscape Improved(二分+贪心)
    ~~~~~~~~~~~~~~~~~~~~~~~~~~

Lei Tao

• 后缀数组 POJ 3415
  
  • 难得就是单调栈的处理。。。。
    画一些例子，发现我们可以让栈内的后缀理论长度递减，这就需要当遇到一个后缀比较小的时候，将栈里面的后缀长的理论缩短一点，然后现在这些后缀的长度都变为了新的这个比较短的后缀，同时要减去多算的这些后缀的贡献。记得LONG LONG 。。。。。