SRM585 div2

250： 题意：给你n个数，让你求这段数里有多少个单调递增序列

　

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;

class LISNumberDivTwo
{
    public:
           int calculate(vector<int>);
};

int LISNumberDivTwo::calculate(vector<int>seq)
{
    int n = seq.size();
    int temp = 55;
    int ret = 0;
    for(int i=0; i<n; i++)
    {
        if(seq[i] <= temp)
        {
            ret++;
        }
        temp = seq[i];
    }
    return ret;
}

500: 题意：给你一个数，代表树的高度，然后问你最少要几个小车可以走完这个树；

                     找规律，找他树里面有多少个三脚叉，三脚叉最多的那层肯定是倒数第二层，然后不停减二，直到 n-2 < 0 ，然后再判断n是否等于1，等于1，说明

                     第一层那个点没算进来，所以要 ret++。

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

class TrafficCongestionDivTwo
{
    public:
           long long theMinCars(int);
};


long long TrafficCongestionDivTwo::theMinCars(int treeHeight)
{
    long long ret = 0;
    int n = treeHeight-1;
    ret = (long long)pow((double)2,(double)n);
    while(n-2>=0)
    {
        ret += (long long)pow((double)2,(double)n-2);
        n = n - 2;
    }
    if(n!=0) ret++;
    return ret;
}