Merge it!
https://codeforces.com/contest/1176/problem/B
題意:合并一些數,使得3的倍數數量最多
題解:貪心
/* *@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],b[5]; 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--){memset(b,0,sizeof(b));scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]),b[a[i]%3]++;temp=min(b[1],b[2]);b[1]-=temp;b[2]-=temp;ans=b[0]+temp+b[1]/3+b[2]/3;cout<<ans<<endl;} #ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }?
總結
- 上一篇: Divide it!
- 下一篇: Lose it!