Crossing
[LeetCode] 1496. Path Crossing
Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. You start at t ......
335. Self Crossing (Hard)
Description 335. Self Crossing (Hard) You are given an array of integers distance. You start at the point (0, 0) on an X-Y plane, and you move distanc ......
Crossing Rivers uva12230
https://www.luogu.com.cn/problem/UVA12230 期望的线性性质 #include<iostream> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,D; ......