比賽地址：https://ac.nowcoder.com/acm/contest/949#question

官方題解：https://ac.nowcoder.com/discuss/205975

Problem A?小石的簽到題

https://ac.nowcoder.com/acm/contest/949/A

題意：

題解：博弈論

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int a[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);cout<<(n!=1?"Shi":"Yang")<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem B?小雨的三角形

https://ac.nowcoder.com/acm/contest/949/B

題意：

題解：楊輝三角+前綴和

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=1000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; ll a[N][N],b[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&m);b[1]=a[1][1]=1;for(int i=2;i<=n;i++){a[i][1]=a[i][i]=i;b[i]=(b[i-1]+a[i][1]+a[i][i])%MOD;for(int j=2;j<i;j++){a[i][j]=(a[i-1][j-1]+a[i-1][j])%MOD;b[i]=(b[i]+a[i][j])%MOD;}}while(m--){scanf("%d%d",&l,&r);cout<<(b[r]-b[l-1]+MOD)%MOD<<endl;}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem C?小石的海島之旅

https://ac.nowcoder.com/acm/contest/949/C

題意：

題解：貪心

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int h[N],a; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",&h[i]);for(int i=1;i<=m;i++){scanf("%d",&a);ans=0;for(int i=1;i<=n;i++)if(h[i-1]<=a&&h[i]>a)ans++;cout<<ans<<endl;}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem D?小陽(yáng)買(mǎi)水果

https://ac.nowcoder.com/acm/contest/949/D

題意：

題解：前綴和+排序+貪心

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=2000000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const ll INF = 0x3f3f3f3f3f3f3f; int t,n,m,k,p; int l,r,u,v; int ans,cnt,flag,temp,sum; ll a[N],b[N]; struct node{ll b;int id;bool operator < (const node &S)const{if(b==S.b)return id>S.id;return b<S.b;} }e[N]; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%lld",&a[i]),b[i]=e[i].b=e[i-1].b+a[i],e[i].id=i;sort(e,e+n+1);int pos=e[0].id;for(int i=1;i<=n;i++){//cout<<pos<<" "<<e[i].id<<endl;if(pos<e[i].id&&b[e[i].id]-b[pos]>0){ans=max(ans,e[i].id-pos);}pos=min(pos,e[i].id);}cout<<ans<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem E?小雨的矩陣

https://ac.nowcoder.com/acm/contest/949/E

題意：

題解：DFS

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int a[N][N]; set<ll>st; void dfs(int x,int y,ll num){if(x==n&&y==n){st.insert(num);}if(x>n||y>n)return;dfs(x+1,y,num+a[x+1][y]);dfs(x,y+1,num+a[x][y+1]); } int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)scanf("%d",&a[i][j]);dfs(1,1,a[1][1]);cout<<st.size()<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem F?小石的妹子

https://ac.nowcoder.com/acm/contest/949/F

題意：

題解：

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans[N],cnt,flag,temp,sum; int tree[N],c[N]; struct node{int a,b;int id;bool operator <(const node &S)const{return a<S.a;} }e[N]; void add(int p,int o){while (p<=n){tree[p]=max(tree[p],o);p+=(p&(-p));} } int ask(int p){int s=0;while (p){s=max(tree[p],s);p-=(p&(-p));}return s; } int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d%d",&e[i].a,&e[i].b);e[i].id=i;c[i]=e[i].b;}sort(c+1,c+n+1);for (int i=1;i<=n;i++) e[i].b=n+1-(lower_bound(c+1,c+n+1,e[i].b)-c);sort(e+1,e+n+1);for (int i=n;i>=1;i--){ans[e[i].id]=ask(e[i].b)+1;add(e[i].b,ans[e[i].id]);}for (int i=1;i<=n;i++) printf ("%d\n",ans[i]);//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem G?小石的圖形

https://ac.nowcoder.com/acm/contest/949/G

題意：

題解：

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int a[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);printf("%.3f\n",n*n/(2*PI));//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem H?小陽(yáng)的貝殼

https://ac.nowcoder.com/acm/contest/949/H

題意：

題解：差分?jǐn)?shù)組+數(shù)論+線段樹(shù)

參考文章：差分?jǐn)?shù)組
區(qū)間 具有結(jié)合律，很容易用線段樹(shù)維護(hù)，考慮如何區(qū)間修改。
首先要知道 的一個(gè)性質(zhì)：

所以我們可以在線段樹(shù)上建立差分?jǐn)?shù)組，維護(hù) 區(qū)間和 與 區(qū)間 。
顯然區(qū)間 的就是 ，其中 表示差分?jǐn)?shù)組。

至于第 2 個(gè)操作完全就是來(lái)搞笑的（主要用來(lái)引導(dǎo)別人聯(lián)想到差分），只要維護(hù)差分?jǐn)?shù)組的區(qū)間 max 和區(qū)間 min 就行了。

最后的答案就是 區(qū)間 max 與 區(qū)間 min 相反數(shù) 的較大值。

C++版本一

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int a[N]; struct node{int val;int minl;int maxl;int sum; }tree[N<<2]; void pushup(int rt){tree[rt].val=__gcd(tree[rt<<1].val,tree[rt<<1|1].val);tree[rt].minl=min(tree[rt<<1].minl,tree[rt<<1|1].minl);tree[rt].maxl=max(tree[rt<<1].maxl,tree[rt<<1|1].maxl);tree[rt].sum=tree[rt<<1].sum+tree[rt<<1|1].sum; } void build(int l,int r,int rt){if(l==r){tree[rt].sum=tree[rt].minl=tree[rt].maxl=tree[rt].val=a[l]-a[l-1];return;}int mid=(l+r)>>1;build(l,mid,rt<<1);build(mid+1,r,rt<<1|1);pushup(rt); } void update(int l,int r,int rt,int L,int C){if(l==r){tree[rt].minl=tree[rt].minl+C;tree[rt].maxl=tree[rt].maxl+C;tree[rt].val=tree[rt].val+C;tree[rt].sum=tree[rt].sum+C;return;}int mid=(l+r)>>1;if(L<=mid)update(l,mid,rt<<1,L,C);else update(mid+1,r,rt<<1|1,L,C);pushup(rt); } int querysum(int l,int r,int rt,int L,int R){if (L > R)return 0;if(L<=l&&r<=R){return tree[rt].sum;}int mid=(l+r)>>1;if(R<=mid) return querysum(l,mid,rt<<1,L,R);else if(mid<L)return querysum(mid+1,r,rt<<1|1,L,R);else return querysum(l,mid,rt<<1,L,R)+querysum(mid+1,r,rt<<1|1,L,R); } int queryval(int l,int r,int rt,int L,int R){if (L > R)return 0;if(L<=l&&r<=R){return tree[rt].val;}int mid=(l+r)>>1;if(R<=mid) return queryval(l,mid,rt<<1,L,R);else if(mid<L)return queryval(mid+1,r,rt<<1|1,L,R);else return __gcd(queryval(l,mid,rt<<1,L,R),queryval(mid+1,r,rt<<1|1,L,R)); } int queryminl(int l,int r,int rt,int L,int R){if (L > R)return 0;if(L<=l&&r<=R){return tree[rt].minl;}int mid=(l+r)>>1;if(R<=mid) return queryminl(l,mid,rt<<1,L,R);else if(mid<L)return queryminl(mid+1,r,rt<<1|1,L,R);else return min(queryminl(l,mid,rt<<1,L,R),queryminl(mid+1,r,rt<<1|1,L,R)); } int querymaxl(int l,int r,int rt,int L,int R){if (L > R)return 0;if(L<=l&&r<=R){return tree[rt].maxl;}int mid=(l+r)>>1;if(R<=mid) return querymaxl(l,mid,rt<<1,L,R);else if(mid<L)return querymaxl(mid+1,r,rt<<1|1,L,R);else return max(querymaxl(l,mid,rt<<1,L,R),querymaxl(mid+1,r,rt<<1|1,L,R)); } void printtree(int l,int r,int rt){if(l==r){printf("%lld ",tree[rt].sum);return;}int mid=(l+r)>>1;printtree(l,mid,rt<<1);printtree(mid+1,r,rt<<1|1); } int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",&a[i]);build(1,n,1);while(m--){scanf("%d%d%d",&p,&l,&r);//printtree(1,n,1);//cout<<endl;if(p==1){scanf("%d",&k);update(1,n,1,l,k);if(r+1<=n)update(1,n,1,r+1,-k);}else if(p==2){cout<<max(abs(querymaxl(1,n,1,l+1,r)),abs(queryminl(1,n,1,l+1,r)))<<endl;}else if(p==3){cout<<abs(__gcd(querysum(1,n,1,1,l),queryval(1,n,1,l+1,r)))<<endl;//cout<<querysum(1,n,1,l,r)<<" "<<queryval(1,n,1,l+1,r)<<endl;}}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

Problem I?石頭剪刀布

https://ac.nowcoder.com/acm/contest/949/I

題意：

題解：

C++版本一

?

Problem J?小雨坐地鐵

https://ac.nowcoder.com/acm/contest/949/J

題意：

題解：

C++版本一

總結(jié)

以上是生活随笔為你收集整理的牛客小白月赛16的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。