摘要:
```#include#include#include#includeusing namespace std;#define int long longconst int N=1e6+10;const int mod=1e9+7;int t;int l,r;int q[N];int dp[200][200];int dfs(int poj,int sum,bool limit){ if(!poj)... 阅读全文
摘要:
```#include#include#include #define Calc(i,j) (f[j-1]-f[i-1])/(a[i].h-a[j].h)using namespace std;const int N=1e5+9;int q[N];double f[N],k[N];struct Land{ int w,h;//结构体排序 inline bool operatorx.h||(h==x... 阅读全文
摘要:
``` #include #include using namespace std; #define int long long const int N=1e6+10,INF=1e9; int n,m; int x[N]; int p[N]; int c[N]; int q[N]; int f[N]; int sump[N];//p[i] int sum[N];//p[i]*x[i] //f[i] 阅读全文
摘要:
```#include#include#include#includeusing namespace std;typedef long long LL;const int maxn = 1e5 + 5;const int inf = 1e6 + 5;int a[maxn],d[maxn];int main(){ int T,n; scanf("%d",&T); for(int cas=1; cas... 阅读全文
摘要:
``` #include #include #include #include #include #include using namespace std; typedef long long ll; const ll MOD = 1e9 + 7; const int maxn = 305; int main() { int T; ll n,k; ll t; cin>>T; //拆成连续的数,然后 阅读全文
摘要:
``` #include #include #include #include using namespace std; const int N = 500010; int arr[N]; int city,box; bool check(int mid) { int sum = 0; for (int i = 0; i >1; if(check(mid)) r=mid; else l=mid+1 阅读全文
摘要:
``` #include #include #include #include using namespace std; typedef long long LL; const int N=1e5+10; int n,ans[N],tr[N],hi[N]; struct node { int h,k,id; } po[N]; int cmp(node a,node b) { return a.h> 阅读全文
摘要:
``` #include #include #include #include using namespace std; const double eps=1e-9; const double pie=3.1415926535; int T; double br,tr,H,v; double getV(double h) { double rr=(tr-br)*h/H+br; //相似三角形 re 阅读全文
摘要:
``` #include #include #include #include #include using namespace std; typedef long long ll; mapmp1; int cnt; void init() { cnt=2; mp1[1]=2; mp1[2]=7; while(mp1[cnt]>n; int ans=0; while(n>=2) { int l=1 阅读全文
摘要:
``` #include #include #include #include #include #define pi acos(-1.0) using namespace std; const int maxn = 10005; int r[maxn]; double v[maxn]; int n,f; bool check(double x) { int cnt = 0; int t = lo 阅读全文