Codeforces Round #145 (Div. 2) C. Weather

题目链接：http://codeforces.com/problemset/problem/234/C

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 t1, t2, …, tn, 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 ≤ k ≤ n - 1) such that t1 < 0, t2 < 0, …, tk < 0 and tk + 1 > 0, tk + 2 > 0, …, tn > 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 ≤ 105) — 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| ≤ 109) — the sequence of temperature values. Numbers ti are separated by single spaces.

Output

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

Examples
input

4
-1 1 -2 1
output
1
input
5
0 -1 1 2 -5
output

2
Note

Note to the first sample: there are two ways to change exactly one number so that the sequence met Vasya’s condition. You can either replace the first number 1 by any negative number or replace the number -2 by any positive number.

题目分析：

给你n天的天气 T1, T2,T3,Tn，
要求开头k天温度小于0，后续大于0的排序才算正常的

在满足条件的前提下，对原序列修改最少几天的温度可以满足要求

输出最少修改的天数

思路：计算前缀大于等于0的和，和计算后缀小于等于的0的和

当前为k=i 则需要修改的天数为pre[i]+bac[i+1]

#include<cstdio>
#include<algorithm>
using namespace std;
#define INT_INF 0x3f3f3f3f      //1061109567
// ios::sync_with_stdio(false);
// 那么cin, 就不能跟C的 scanf，sscanf, getchar, fgets之类的一起使用了。
const int maxn=100005;
int a[maxn];
int pre[maxn];
int bac[maxn];
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
        scanf("%d",&a[i]);
    for(int i=1;i<=n;++i)
    {
        if(a[i]>=0)
            pre[i]++;
        pre[i]+=pre[i-1];
    }    //从前至后分析记录，只需改变0或大于0的
    for(int i=n;i>=1;--i)
    {
        if(a[i]<=0)
            bac[i]++;
        bac[i]+=bac[i+1];
    }    //从后至前分析记录，只需改变0或小于0的
    int minn=INT_INF;
    for(int i=1;i<n;++i)
        minn=min(minn,pre[i]+bac[i+1]);//从前至后同时分析，去全部操作的最小值
    printf("%d\n",minn);
    return 0;
}