摘要:
#include<bits/stdc++.h>using namespace std;vector<int>tree[1000010];int sum=0;int dfs(int x, int y){ int first = 0, second = 0; for (int i = 0; i < tr 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;const long long mod=1000000007,inv=570000004;long long i,j,n,m,a[1010]/*成功几率*/,sum=0,dp[1010][1010]/*动态规划*/ 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;typedef long long ll;const int mod = 1e9+7;const int inf = 0x3f3f3f3f;const int mx = 1e6+5;struct node{ int 阅读全文