looeyWei的博客

#include <iostream> #include <algorithm> using namespace std; const int maxn = 1000 + 10; struct node{ int s,t; }a[maxn]; int n; bool cmp(node a,node b){ return a.t<b.t; } int solve()...

#include <iostream> #include <algorithm> using namespace std; const int maxm = 5000 + 10; const int maxn = 3e4 + 10; struct node{ int s,t,num; }a[maxm]; int n,m; bool vis[maxn]; bool cmp(...

#include <iostream> #include <algorithm> #include <cmath> using namespace std; const int maxn = 15000 + 10; //const int maxn = 3e4 + 10; struct node{ double s,t; }a[maxn]; int n,tot...