/*
 * =========================================================================
 *
 *       FileName:  leetcode_122.cpp
 *
 *    Description:
 *
 *        Version:  1.0
 *        Created:  2018-11-28 15:41:10
 *  Last Modified:  2018-11-28 15:41:24
 *       Revision:  none
 *       Compiler:  gcc
 *
 *         Author:  zt ()
 *   Organization:
 *
 * =========================================================================
 */

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stddef.h>
#include <string.h>
#include <signal.h>
#include <errno.h>
#include <unistd.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/socket.h>

#include <iostream>
#include <memory>
#include <algorithm>
#include <vector>
#include <thread>
#include <mutex>
#include <map>
#include <list>
#include <string>
#include <functional>

using namespace std;

int maxProfit ( vector<int>& prices )
{
  int ret = 0;
  int len = prices.size();

  for ( int i = 0; i < len - 1; ++i )
  {
    if ( prices[i] < prices[i + 1] )
      ret += prices[i + 1] - prices[i];
  }

  return ret;
}

int main ( int argc, char* argv[] )
{
  ( void ) argc;
  ( void ) argv;


  return 0;
}