CodeForces 596B Wilbur and Array 贪心

给出原始{ai}={0}，{bi}。每次修改{ai..n}+1或-1，求最小操作次数使{ai}=={bi}。

累计相邻两数差即可。

因为差最大10^9，数字有2*10^5，要long long。

#include <cstdio>
#include <cstdlib>
typedef long long ll;
int main() {static ll a[200001];int n,i;scanf("%d", &n);for(i=1;i<=n;i++) scanf("%I64d", &a[i]);ll ans=abs(a[1]);for(i=2;i<=n;i++)ans+=abs(a[i]-a[i-1]);printf("%I64d", ans);return 0;
}

B. Wilbur and Array

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Wilbur the pig is tinkering with arrays again. He has the array a1, a2, ..., an initially consisting of n zeros. At one step, he can choose any index i and either add 1 to all elementsai, ai + 1, ... , an or subtract 1 from all elements ai, ai + 1, ..., an. His goal is to end up with the array b1, b2, ..., bn.

Of course, Wilbur wants to achieve this goal in the minimum number of steps and asks you to compute this value.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the length of the array ai. Initially ai = 0 for every position i, so this array is not given in the input.

The second line of the input contains n integers b1, b2, ..., bn ( - 109 ≤ bi ≤ 109).

Output

Print the minimum number of steps that Wilbur needs to make in order to achieve ai = bi for all i.

Sample test(s)

input

5
1 2 3 4 5

output

input

4
1 2 2 1

output

Note

In the first sample, Wilbur may successively choose indices 1, 2, 3, 4, and 5, and add 1 to corresponding suffixes.

In the second sample, Wilbur first chooses indices 1 and 2 and adds 1 to corresponding suffixes, then he chooses index 4 and subtract 1.

CodeForces 596B Wilbur and Array 贪心相关推荐

CodeForces 596B Wilbur and Array
简单题,一个一个操作,最后就是答案. #include<cstdio> #include<cstring> #include<cmath> #include< ...
Wilbur and Array
Wilbur and Array Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit St ...
codeforces Gym 100338E Numbers （贪心，实现）
题目:http://codeforces.com/gym/100338/attachments 贪心,每次枚举10的i次幂,除k后取余数r在用k-r补在10的幂上作为候选答案. #include< ...
CodeForces 1514A Perfectly Imperfect Array
CodeForces 1514A Perfectly Imperfect Array 题意: 给你n个数,是否存在一个数不是平方数题解: 先开方,转int,判断是否等于平方代码: #include ...
cf596B. Wilbur and Array
B. Wilbur and Array time limit per test 2 seconds memory limit per test 256 megabytes input standard ...
CodeForces - 1480D1 Painting the Array I(贪心)
题目链接:点击查看题目大意:给出一个长度为 nnn 的序列,现在要求拆分成两个子序列,使得两个子序列的贡献之和最大.对于一个序列的贡献就是,去掉相邻且相同的字母后的长度,即 ∑i=1n[a[i]! ...
CodeForces 596 B Wilbur and Array
<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255) ...
Codeforces G. Nick and Array（贪心）
题目描述: Nick had received an awesome array of integers a=[a1,a2,-,an] as a gift for his 5 birthday fro ...
CodeForces - 1480D2 Painting the Array II(dp)
题目链接:点击查看题目大意:给出一个长度为 nnn 的序列,现在要求拆分成两个子序列,使得两个子序列的贡献之和最小.对于一个序列的贡献就是,去掉相邻且相同的字母后的长度,即 ∑i=1n[a[i]! ...

CodeForces 596B Wilbur and Array 贪心

CodeForces 596B Wilbur and Array 贪心相关推荐

最新文章

热门文章