zoukankan      html  css  js  c++  java
  • 【LG5019】[NOIP2018]道路铺设

    【LG5019】[NOIP2018]道路铺设

    题面

    洛谷

    题解

    (NOIP)(NOIP)差评

    设当前做到了位置(i)

    (h_i) (-) (h_i)(_+)(_1) (=) (x)

    (x>0)(x)加入贡献即可

    #include<iostream>
    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    inline int gi() {
    	register int data = 0, w = 1;
    	register char ch = 0;
    	while (ch != '-' && !isdigit(ch)) ch = getchar();
    	if (ch == '-') w = -1, ch = getchar();
    	while (isdigit(ch)) data = data * 10 + ch - '0', ch = getchar();
    	return w * data; 
    }
    #define MAX_N 100005 
    int N, a[MAX_N], b[MAX_N];
    
    int main () {
    	N = gi();
    	for (int i = 1; i <= N; i++) b[i] = a[i] = gi(); 
    	for (int i = 1; i <= N; i++) b[i + 1] -= a[i];
    	int ans = 0; 
    	for (int i = 1; i <= N; i++) if (b[i] > 0) ans += b[i];
    	printf("%d
    ", ans); 
    	return 0; 
    } 
    
  • 相关阅读:
    POJ3164 Command Network
    UVa11401 Triangle Counting
    UVa11174 Stand in a Line
    UVa11806 Cheerleaders
    Uva11538 Chess Queen
    Bzoj3130 [Sdoi2013]费用流
    Bzoj3262 陌上花开
    模拟25A 题解
    模拟24 题解
    模拟23 题解
  • 原文地址:https://www.cnblogs.com/heyujun/p/9979365.html
Copyright © 2011-2022 走看看