cf599C Day at the Beach(区间合并)

原创 2015年11月21日 09:20:18

C. Day at the Beach
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
One day Squidward, Spongebob and Patrick decided to go to the beach. Unfortunately, the weather was bad, so the friends were unable to ride waves. However, they decided to spent their time building sand castles.

At the end of the day there were n castles built by friends. Castles are numbered from 1 to n, and the height of the i-th castle is equal to hi. When friends were about to leave, Squidward noticed, that castles are not ordered by their height, and this looks ugly. Now friends are going to reorder the castles in a way to obtain that condition hi ≤ hi + 1 holds for all i from 1 to n - 1.

Squidward suggested the following process of sorting castles:

Castles are split into blocks — groups of consecutive castles. Therefore the block from i to j will include castles i, i + 1, …, j. A block may consist of a single castle.
The partitioning is chosen in such a way that every castle is a part of exactly one block.
Each block is sorted independently from other blocks, that is the sequence hi, hi + 1, …, hj becomes sorted.
The partitioning should satisfy the condition that after each block is sorted, the sequence hi becomes sorted too. This may always be achieved by saying that the whole sequence is a single block.
Even Patrick understands that increasing the number of blocks in partitioning will ease the sorting process. Now friends ask you to count the maximum possible number of blocks in a partitioning that satisfies all the above requirements.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of castles Spongebob, Patrick and Squidward made from sand during the day.

The next line contains n integers hi (1 ≤ hi ≤ 109). The i-th of these integers corresponds to the height of the i-th castle.

Output
Print the maximum possible number of blocks in a valid partitioning.

Sample test(s)
input
3
1 2 3
output
3
input
4
2 1 3 2
output
2
Note
In the first sample the partitioning looks like that: [1][2][3].
这里写图片描述

In the second sample the partitioning is: [2, 1][3, 2]
这里写图片描述

就是给一个序列,然后划分区间,每个区间自己排序之后的结果和整体排序的结果是一样的,问最多划分多少区间。

当时按照区间的思想想了一下,每个数排序之后都是有位置的,那么这个数现在的位置到排序后的位置就是这个数的最短区间。
然后猜想一下(因为有的数会有多个)
找出这个数的上下界up,down
1.如果现在位置在上下界内,区间就是[i,i];
2.如果在下界以下,就是[i,down];
3.上界以上,就是[up,i];
然后得到n个区间,接着区间合并,看有多少个独立区间。

当时没有完整证明出来,现在还是想不通,只能从yy角度上想通一点,找了半天也没有反例,而且终测也过了,看样应该有道理,再想想吧。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int a[100005],b[100005];
struct Node
{
    int l,r;
}node[100005];
bool cmp(Node a,Node b)
{
    if(a.l == b.l)return a.r < b.r;
    return a.l < b.l;
}
int main()
{
    #ifdef LOCAL
    freopen("C:\\Users\\ΡΡ\\Desktop\\in.txt","r",stdin);
    //freopen("C:\\Users\\ΡΡ\\Desktop\\out.txt","w",stdout);
    #endif // LOCAL
    int n;
    scanf("%d",&n);
    for(int i = 1;i <= n;i++)
        scanf("%d",&a[i]);
    for(int i = 1;i <= n;i++)b[i] = a[i];
    sort(b + 1,b + 1 + n);
    for(int i = 1;i <= n;i++)
    {
        int down = lower_bound(b + 1,b + 1 + n,a[i]) - b;
        int up = upper_bound(b + 1,b + 1 + n,a[i]) - b - 1;
        if(down <= i &&i <= up)node[i].l = node[i].r = i;
        else if(i < down)
        {
            node[i].l = i;node[i].r = down;
        }
        else
        {
            node[i].r = i;node[i].l = up;
        }
    }
    /*for(int i = 1;i <= n;i++)
        cout<<node[i].l<<" "<<node[i].r<<endl;*/
    sort(node + 1,node + 1 + n,cmp);
    int ans,l,r;
    ans = 1;l = node[1].l;r = node[1].r;
    for(int i = 2;i <= n;i++)
    {
        if(node[i].l > r)
        {
            ans++;l = node[i].l;r = node[i].r;
        }
        else
            r = max(r,node[i].r);
    }
    printf("%d\n",ans);
    return 0;
}
版权声明:希望各位巨巨多多赐教

Codeforces 599C Day at the Beach 【思维】

C. Day at the Beach time limit per test 2 seconds memory limit per test 256 megabytes input st...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015年11月23日 22:06
  • 786

Codeforces 599C Day at the Beach

题目链接:http://codeforces.com/problemset/problem/599/C 题意:给出大小为n的序列,要求将该序列分成连续的若干个部分,每个部分各自升序排序后组成...
  • csdn364988181
  • csdn364988181
  • 2016年03月10日 17:46
  • 387

【Codeforces Round 332 (Div 2)C】【贪心】Day at the Beach 最多区间数划分使得区间排序构成全局排序

C. Day at the Beach time limit per test 2 seconds memory limit per test 256 megabytes ...
  • snowy_smile
  • snowy_smile
  • 2015年12月02日 12:13
  • 397

Codeforces Round #332 (Div. 2)——C. Day at the Beach

题意: 现在有n个城堡,然后每个城堡都有一个高度h[i],现在问你要把这个n个城堡按照高度来排序的话,最多需要进行几次操作。 操作必须满足: 现在你可以把城堡划分为几个块,然后必须满足如下条件:...
  • ACMer_hades
  • ACMer_hades
  • 2015年11月21日 13:54
  • 273

codeforces 559C Day at the Beach

题意: 给你一个大小为n序列,要求该序列分解成若干块,这若干块升序排列的时候要和原来大小为n的升序序列相同,问你最多可以分成多少块。 题解: 想了一晚上,要分块并且保持升序的话,...
  • Start_to_crazy
  • Start_to_crazy
  • 2017年10月22日 02:25
  • 60

codeforce 599C Day at the Beach

Day at the Beach   limit 2s 256M       One day Squidward, Spongebob and Patrick decided to go to the...
  • zwsign
  • zwsign
  • 2016年03月27日 13:56
  • 189

CodeForces 599C Day at the Beach

描述:输入n个整型数据,要求对数据分块,要求分块后对每块数据排序的结果和对所有n个数据排序的结果是相同的。思路很简单,可以分析出一个性质是:本分组的数据最大值一定小于本组后的所有数据最小值。然后分别用...
  • AleiChen
  • AleiChen
  • 2015年11月28日 19:27
  • 177

Aanya’s Day at the Beach

Last Saturday I went to the beach. Khae wanted to go to the beach, but she didn’t know how to get th...
  • u013322949
  • u013322949
  • 2017年05月04日 02:12
  • 103

CF- Day at the Beach

C. Day at the Beach time limit per test 2 seconds memory limit per test 256 megabytes inp...
  • qq_23908539
  • qq_23908539
  • 2016年04月29日 15:56
  • 44

CodeForces 599C Day at the Beach

B - Day at the Beach Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64...
  • qq_33406883
  • qq_33406883
  • 2016年05月14日 20:12
  • 258
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:cf599C Day at the Beach(区间合并)
举报原因:
原因补充:

(最多只允许输入30个字)