CodeForces - 786C——二分+模拟？

【题目描述】

Rick and Morty want to find MR. PBH and they can't do it alone. So they need of Mr. Meeseeks. They Have generated n Mr. Meeseeks, standing in a line numbered from 1 to n. Each of them has his own color. i-th Mr. Meeseeks' color is ai.Rick and Morty are gathering their army and they want to divide Mr. Meeseeks into some squads. They don't want their squads to be too colorful, so each squad should have Mr. Meeseeks of at most k different colors. Also each squad should be a continuous subarray of Mr. Meeseeks in the line. Meaning that for each 1 ≤ i ≤ e ≤ j ≤ n, if Mr. Meeseeks number i and Mr. Meeseeks number j are in the same squad then Mr. Meeseeks number e should be in that same squad.Also, each squad needs its own presidio, and building a presidio needs money, so they want the total number of squads to be minimized.Rick and Morty haven't finalized the exact value of k, so in order to choose it, for each k between 1 and n (inclusive) need to know the minimum number of presidios needed.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 105) — number of Mr. Meeseeks.The second line contains n integers a1, a2, ..., an separated by spaces (1 ≤ ai ≤ n) — colors of Mr. Meeseeks in order they standing in a line.

Output

In the first and only line of input print n integers separated by spaces. i-th integer should be the minimum number of presidios needed if the value of k is i.

Examples
Input

5
1 3 4 3 3

Output

4 2 1 1 1

Input

8
1 5 7 8 1 7 6 1

Output

8 4 3 2 1 1 1 1

【题目分析】
这道题放在线段树里面我实在没有什么想法，觉得就暴力一下不可以吗？可是估计了一下时间应该会超时，在网上看到一种想法，就是二分暴力，如果区间两端答案一样那么说明中间的所有的答案都是一样的，因为答案应该是非线性递减的。
【AC代码】

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<climits>
#include<queue>
#include<vector>
#include<set>
#include<map>
using namespace std;typedef long long ll;
const int INF=0x3f3f3f3f;
const int MAXN=1e5+5;
int a[MAXN];
int vis[MAXN];
int ans[MAXN];
int n;void Read()
{scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}
}int GetAns(int k)  //模拟
{memset(vis,-1,sizeof(vis));int cnt=0,ret=1;for(int i=1;i<=n;i++){if(vis[a[i]]==ret) continue;cnt++;if(cnt>k){ret++;cnt=1;}vis[a[i]]=ret;}return ret;
}void Solve(int l,int r)    //二分
{if(l>r) return;int ansl=GetAns(l);int ansr=GetAns(r);if(ansl==ansr){for(int i=l;i<=r;i++){ans[i]=ansl;}return;}ans[l]=ansl; ans[r]=ansr;int mid=(l+r)>>1;Solve(l+1,mid); Solve(mid+1,r-1);
}void Print()
{for(int i=1;i<=n;i++){printf("%d ",ans[i]);}
}int main()
{Read();Solve(1,n);Print();return 0;
}

CodeForces - 786C——二分+模拟？相关推荐

CodeForces - 1236D Alice and the Doll(贪心+二分+模拟)
题目链接:点击查看题目大意:给出一个n*m的矩阵,矩阵中有k个障碍物,在点(1,1)处有一个洋娃娃,洋娃娃每次的行动路线只能是直走或右拐,初始时洋娃娃面朝正右方向,问洋娃娃能否将所有方格都走一遍,并 ...
CodeForces - 1491E Fib-tree(模拟)
题目链接:点击查看题目大意:给出一棵树,问是否为斐波那契树.斐波那契树的定义是,树的大小为斐波那契数列的其中一项,且可以通过删除掉一条边使其拆分的两个子树也为斐波那契树题目分析:需要观察到,大小为 ...
PAT (Advanced Level) 1010 Radix(二分+模拟)
题目链接:点击查看题目大意:给出两个数n1和n2,再给出其中一个数的进制,问另一个数能否选择一个进制,使得两个数的值相等题目分析:首先这个题目一开始会错意了,因为题中的表示只给出了0~9以及a~z ...
zoj4062 Plants vs. Zombies 二分+模拟（贪心的思维）
题目传送门题目大意:有n个植物排成一排,标号为1-n,每株植物有自己的生长速度ai,每对植物浇一次水,该株植物就长高ai,现在机器人从第0个格子出发,每次走一步,不能停留,每一步浇一次水,总共可以走 ...
Match Points CodeForces 1156C 二分答案
CodeForces 1156C Match Points 传送门:https://codeforces.com/problemset/problem/1156/C You are given a s ...
Codeforces 650B 二分
题目:http://codeforces.com/problemset/problem/650/B 题意: :给n张图片循环可看,每张图片的朝向为横(w)|竖(v),但是手机是竖直放置的.开始时打开的 ...
二分 + 模拟 - Carries
Carries Problem's Link Mean: 给你n个数,让你计算这n个数两两组合相加的和进位的次数. analyse: 脑洞题. 首先要知道:对于两个数的第k位相加会进位的条件是:a%( ...
codeforces 719C (复杂模拟-四舍五入-贪心)
题目链接:http://codeforces.com/problemset/problem/719/C 题目大意: 留坑... 转载于:https://www.cnblogs.com/A--Q/p/5 ...
Codeforces 67A【模拟】
题意: 给一个字符串代表相邻学生的比较,L代表左边多,R表示右边多,=表示左右相等. 保证每个人拿糖>=1,在分糖最少的情况下,输出每个学生所分得的糖. 思路: 模拟一下,第一个人一开始拿1个, ...

CodeForces - 786C——二分+模拟？

CodeForces - 786C——二分+模拟？相关推荐

最新文章

热门文章