234C Weather

最新推荐文章于 2024-11-05 21:58:11 发布

感觉画质不如…原神

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量233

点赞数 1

分类专栏： Codeforces 文章标签：算法 c++

本文链接：https://blog.csdn.net/m0_74396439/article/details/128805383

版权

Codeforces 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

题目链接

234C. Weather Rating:1300

题目描述

Scientists say a lot about the problems of global warming and cooling of the Earth. Indeed, such natural phenomena strongly influence all life on our planet.

Our hero Vasya is quite concerned about the problems. He decided to try a little experiment and observe how outside daily temperature changes. He hung out a thermometer on the balcony every morning and recorded the temperature. He had been measuring the temperature for the last n days. Thus, he got a sequence of numbers $t 1, t 2, ..., t n$ , where the i-th number is the temperature on the i-th day.

Vasya analyzed the temperature statistics in other cities, and came to the conclusion that the city has no environmental problems, if first the temperature outside is negative for some non-zero number of days, and then the temperature is positive for some non-zero number of days. More formally, there must be a positive integer $k (1 \leq k \leq n - 1)$ such that $t 1 < 0, t 2 < 0, ..., t k < 0$ and $t k + 1 > 0, t k + 2 > 0, ..., t n > 0$ . In particular, the temperature should never be zero. If this condition is not met, Vasya decides that his city has environmental problems, and gets upset.

You do not want to upset Vasya. Therefore, you want to select multiple values of temperature and modify them to satisfy Vasya’s condition. You need to know what the least number of temperature values needs to be changed for that.

Input

The first line contains a single integer n( $2 ≤ n ≤ 10^5$ ) — the number of days for which Vasya has been measuring the temperature.

The second line contains a sequence of n integers $t1, t2, ..., tn (|ti| ≤ 10^9)$ — the sequence of temperature values. Numbers ti are separated by single spaces.

Output

Print a single integer — the answer to the given task.

inputCopy

4
-1 1 -2 1

outputCopy

1

inputCopy

5
0 -1 1 2 -5

outputCopy

2

大致题意：

给你一个长度为 n的数组，里面的元素有正有负。你的一次操作可以将任意正数变为负数 或者将任意负数变为正数。

求让原序列变为 “----+++++…” 的序列的最少操作次数。即前面全是负数，后面全是负数（也可能这部分没有）。

分析：

定义 $n o nn e g (i)$ 为区间 $[1, i]$ 中的 非负数 个数。
定义 $n o n p os (i)$ 为区间 $[i, n]$ 中的 非正数 的个数。

如果我们让 $[1, i]$ 全部变为负数， $[i + 1, n]$ 全部变为正数的操作次数为 $n o nn e g (i) + n o n p os (i + 1)$ 。

我们只需要从 $[1, n - 1]$ 遍历一遍，取最小的值，就是最小的操作次数。

时间复杂度： $O (n)$

代码：

# include <cstdio>
# include <algorithm>
 
using namespace std;
const int N = 1e5+10;
 
int a[N];
int nonneg[N],nonpos[N];
 
int main()
{

    FILE *f1,*f2;
    f1=fopen("input.txt","r");
    f2=fopen("output.txt","w");
    
    int n;
    fscanf(f1,"%d",&n);
    
    for(int i=1;i <= n;i++)
        fscanf(f1,"%d",a+i);
    
    nonneg[1]=(a[1]>=0)?1:0;
    for(int i=2;i<=n;i++)
        nonneg[i]=nonneg[i-1]+((a[i]>=0)?1:0);
    
    nonpos[n]=(a[n]<=0)?1:0;
    for(int i=n;i>=1;i--)
        nonpos[i]=nonpos[i+1]+((a[i]<=0)?1:0);
    
    int ans=n;
    for(int i=1;i < n;i++)
        ans=min(ans,nonneg[i]+nonpos[i+1]);
    
    fprintf(f2,"%d\n",ans);
    
    fclose(f1);
    fclose(f2);
    
 
    
    return 0;
}