09 2020 档案
摘要:fill(len,len + maxn,INF); len[0] = 0; int ans = 0; REP(i,n){ //cout<<A[i]<<' '; int L = 0,R = ans; while (L < R){ int mid = (L + R + 1) >> 1; if (len[
阅读全文
摘要:题目链接: #include<bits/stdc++.h> using namespace std; #define n 1010 struct point{ int x, y; double rad; bool operator < (point b){ return rad < b.rad; }
阅读全文
摘要:#include<bits/stdc++.h> using namespace std; struct point{ int x, y, id; point(int a = 0, int b = 0){x = a, y = b; } friend point operator -(point a,
阅读全文

浙公网安备 33010602011771号