Prefix Sum Primes

https://codeforces.com/contest/1150/problem/C

题解：思维+贪心

按2 1 2 2 2 ...... 1 1 1 1就可以了

/*
*@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=200000+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[3];
int a[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",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);sum[a[i]]++;}if(sum[2]){b[++cnt]=2;sum[2]--;}if(sum[1]){b[++cnt]=1;sum[1]--;}while(sum[2]){b[++cnt]=2;sum[2]--;}while(sum[1]){b[++cnt]=1;sum[1]--;}for(int i=1;i<=cnt;i++)printf("%d%c",b[i]," \n"[i==cnt]);//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Prefix Sum Primes相关推荐

【CodeForces - 1150C】Prefix Sum Primes（思维）
题干: We're giving away nice huge bags containing number tiles! A bag we want to present to you contai ...
CodeForces - 1485F Copy or Prefix Sum(dp)
题目链接:点击查看题目大意:给出数组 bbb,问可以构造出多少种满足条件的数组 aaa,规定数组 aaa 和数组 bbb 的关系如下: bi=aib_i = a_ibi=ai or bi=∑j= ...
codeforces1485 F. Copy or Prefix Sum（dp）
F. Copy or Prefix Sum Venice technique简要就是懒标记思想. 由于前缀和数组和原数组一一对应,这里我们选择求aia_iai的前缀和数组的方案数(下面aia_iai ...
牛客网暑期ACM多校训练营（第九场）H. Prefix Sum（CDQ分治）
题目描述 Niuniu has learned prefix sum and he found an interesting about prefix sum. Let's consider (k+1 ...
牛客网暑期ACM多校训练营（第十场）D Rikka with Prefix Sum
链接:https://www.nowcoder.com/acm/contest/148/D 来源:牛客网题目描述 Prefix Sum is a useful trick in data struc ...
Prefix Sum 总结
注意:prefixsum一般都是用PrefixSum[n+1]的数组,prefix[0] = 0; 那么因为i, j 是A里面的坐标,而prefixsum比A多了1:所以原来的sum[j] - su ...
OpenGL 2D Prefix Sum 2维前缀总和的实例
OpenGL 2维前缀总和先上图,再解答. 完整主要的源代码源代码剖析先上图,再解答. 完整主要的源代码 #include <vmath.h> #include <shader ...
牛客网暑期ACM多校训练营（第十场）D Rikka with Prefix Sum （组合数学）
https://www.nowcoder.com/acm/contest/148/D 题意一个A数组,初始全为0.现有三种操作,1:给区间[L,R]+w:2:把每个位置的元素变为其前缀和:3:求区间 ...
Codeforces Round #556 (Div. 1Div. 2)
Codeforces Round #556 (Div. 1&&Div. 2) 题号题目知识点 A Stock Arbitraging 贪心 B Tiling Challenge 贪 ...

Prefix Sum Primes

Prefix Sum Primes相关推荐

最新文章

热门文章