摘要:
#include using namespace std; int cnt[2][1100000]; int a[300010]; int main() { int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); int tmp=0; long long ans=0; ... 阅读全文
摘要:
#include using namespace std; int a[1000010]; long long dp[1000010][3][3]; int main() { int n,m; scanf("%d%d",&n,&m); for(int i=1;ia[i]) continue; ... 阅读全文
摘要:
ll modpow(ll a, ll b) { ll ans = 1, base = a%MOD; while(b != 0) { if(b&1 != 0) ans = (ans*base)%MOD; base = (base*base)%MOD; b >>= 1; } return... 阅读全文
摘要:
#include using namespace std; const int MOD=(int)1e9+7; typedef long long ll; ll poww(ll a, ll b) { ll ans = 1, base = a%MOD; while(b != 0) { if(b&1 != 0) ans = (ans*b... 阅读全文