codeforces Chip and Ribbon

思路

很容易想到~~其实也不容易~~ 一段连续的数字如果后面的数字比前面一个小那么后面这个数字就不用
对于被

奇妙的来了

#include<bits/stdc++.h&gt;
#define il inline
#define get getchar
#define put putchar
#define is isdigit
#define re register
#define int long long
#define dfor(i,a,b) for(re int i=a;i<=b;++i)
#define dforr(i,a,b) for(re int i=a;i&gt;=b;--i)
#define dforn(i,a,b) for(re int i=a;i<=b;++i,put(10))
#define mem(a,b) memset(a,b,sizeof a)
#define memc(a,b) memcpy(a,b,sizeof a)
#define pr 114514191981
#define gg(a) cout<<a,put(32)
#define INF 0x7fffffff
#define tt(x) cout<<x<<'n'
#define ls i<<1
#define rs i<<1|1
#define la(r) tr[r].ch[0]
#define ra(r) tr[r].ch[1]
#define lowbit(x) (x&amp;-x)
using namespace std;
typedef unsigned int ull;
int read(void)
{
    re int x=0,f=1;re char c=get();
    while(!is(c)) (f=c==45?-1:1),c=get();
    while(is(c)) x=(x<<1)+(x<<3)+(c^48),c=get();
    return x*f;
}
void write(int x)
{
    if(x<0) x=-x,put(45);
    if(x&gt;9) write(x/10);
    put((x%10)^48);
}
#define writeln(a) write(a),put(10)
#define writesp(a) write(a),put(32)
#define writessp(a) put(32),write(a)
const int N=2e5+10,M=3e4+10,SN=1e4+10,mod=998244353;
int n,a[N];
signed main()
{
    int T=read();
    while(T--)
    {
        n=read();
        re int ans=-1,cnt=0;
        dfor(i,1,n) a[i]=read();
        re int l=0,r=0;
//        while(r<=n&amp;&amp;l<=n)
//        {
//            while(!a[l]&amp;&amp;l<=n) ++l;
//            ++cnt,r=l;
//            while(a[r]&amp;&amp;r<=n) ++r;
//            l=r;
//        }
//        cout<<cnt<<"DF"<<endl;
//        ans+=cnt-1;
        dfor(i,1,n)
            if(a[i]<=a[i-1]) continue;
            else ans+=a[i]-a[i-1];
        writeln(ans);
    }
    return 0;
}