摘要:
A 牛牛的DRB迷宫I 思路:dp求方案数 1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long ll; 4 #define MOD 1000000007 5 const int maxn=1e5+100; 6 ll 阅读全文
摘要:
How I Mathematician Wonder What You Are! POJ - 3130 题意:判断多边形是否有内核 思路:半平面交题,逆时针存入 1 // 2 // Created by HJYL on 2020/2/6. 3 // 4 #include<iostream> 5 #i 阅读全文