HDU-6019 MG loves gold

本文介绍了一个有趣的挖宝问题,目标是最少使用铲子的数量来挖取所有不同颜色的宝石。通过遍历序列并利用哈希表跟踪已挖取的颜色,实现了高效算法。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

MG loves gold

 

 

Description

MG is a lucky boy. He is always be able to find gold from underground.

It is known that the gold is a sequence with $n$ elements, which has its own color $C$.

MG can dig out a continuous area of sequence every time by using one shovel, but he's unwilling to dig the golds of the same color with one shovel.

As a greedy person, he wish to take all the n golds away with least shovel.
The rules also require MG not to dig twice at the same position.

MG thought it very easy and he had himself disdained to take the job. As a bystander, could you please help settle the problem and calculate the answer?

 

Input

The first line is an integer $T$ which indicates the case number.($1<=T<=10$)

And as for each case, there are $1$ integer $n$ in the first line which indicate gold-number($1<=n<=100000$).

Then there are $n$ integers $C$ in the next line, the x-th integer means the x-th gold’s color($|C|<=2000000000$).

 

Output

As for each case, you need to output a single line.

there should be one integer in the line which represents the least possible number of shovels after taking away all $n$ golds.

 

Sample Input

 2

5

1 1 2 3 -1

5

1 1 2 2 3

 

Sample Output

 2

3

 

 

#include<iostream>

#include<stdio.h>

#include<algorithm>

#include<cstring>

#include<map>

using namespace std;

 

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

        int n;

        scanf("%d",&n);

        int i,a[100008],sum=1;

        for(i=0;i<n;i++)

        {

            scanf("%d",&a[i]);

        }

        map<int,int>t;

        t[a[0]]=1;

        for(i=1;i<n;i++)

        {

            if(t[a[i]]==1)

            {

                sum++;

                t.clear();

                t[a[i]]=1;//中间一定要注意清空

            }

            else

            {

                t[a[i]]=1;

            }

        }

        printf("%d\n",sum);

    }

    return 0;

}

 

 

 

 

 

题意:用一把铲子去挖宝石,每个宝石都有自己的颜色(宝石上面的数字代表颜色),可以连续着挖一段,但是同一把铲子不能挖到同一种颜色的宝石,问最少用多少铲子可以把宝石挖完。


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值