The Monkey and the Oiled Bamboo

    #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int tcases,nelem,k,mink,aux;
    cin>>tcases;
    for (int j=1;j<=tcases;j++){
        cin>>nelem;
        vector<int>v;
        int indk=0,antk=0;

        for (int i=0;i<nelem;i++){
            cin>>aux;

            //if (j==103)
            //  cout<<aux-antk<<' ';

            v.push_back(aux-antk);

            if (i==0)
                k=aux-antk;
            else if ((aux-antk)>k)
                k=aux-antk;
            antk=aux;
        }
        //if (j==103)
        //  cout<<endl;
        mink=k;
        //cout<<k<<endl;
        while(v[indk]!=k)
            indk++;

        while(indk<=v.size()){
            //cout<<indk<<endl;
            //if (j==1)
            //  cout<<v[m]<<endl;
            int hello=0;
            for (int n=indk+1;n<v.size();n++){
                if (v[n]==k){
                    mink++;
                    hello=1;
                    break;
                }
            }
            if (hello==1)
                break;
            for (int n=indk+1;n<v.size();n++){
                if (v[n]==(k-1)){
                    indk=n;
                    k--;
                    hello=1;
                    break;
                }
            }
            if (hello==0)
                break;

        }

        //if (j==103)
        cout<<"Case "<<j<<": "<<mink<<endl;
    }
    return 0;
}