USACO Section 4.3 Buy low,Buy lower(LIS)

第一眼看到题目，感觉水水的，不就是最长下降子序列嘛！然后写……就呵呵了..要判重，还要高精度……判重我是在计算中加入各种判断。这道题比看上去麻烦一点，但其实还好吧..

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

#define rep(i,l,r) for(int i=l;i<r;i++)
#define clr(x,c) memset(x,c,sizeof(x))

using namespace std;

const int inf=0x3f3f3f3f,maxn=+,maxv=;
int c[maxn],mdp[maxn],MDP[maxn][maxv];

int dp(int i) {
    if(mdp[i]>) return mdp[i];
    int ans=;
    rep(j,,i) if(c[j]>c[i]) ans=max(dp(j),ans);
    return mdp[i]=ans+;
}

int main() {
    freopen("buylow.in","r",stdin);
    freopen("buylow.out","w",stdout);

    int n;
    cin>>n;
    rep(i,,n) scanf("%d",&c[i]);
    clr(mdp,); mdp[]=;
    clr(MDP,);
    MDP[][]=; MDP[][]=;
    rep(i,,n)
        if(dp(i)==) {
            int pd=;
            rep(j,,i) if(c[j]==c[i] && dp(i)==dp(j)) pd=;
            if(!pd) { MDP[i][]=; MDP[i][]=; }
        }
        else {
            int r=;
            rep(j,,i) if(dp(j)==dp(i) && c[i]==c[j]) r=j+;
            rep(j,r,i) if(dp(j)+==dp(i) && c[j]>c[i]) {
                int t=max(MDP[i][],MDP[j][]);
                rep(k,,t+) MDP[i][k]+=MDP[j][k];
                rep(k,,t+) if(MDP[i][k]/) {
                    MDP[i][k+]+=MDP[i][k]/;
                    MDP[i][k]%=;
                }
                while(MDP[i][++t]) if(MDP[i][t]/) {
                    MDP[i][t+]+=MDP[i][t]/;
                    MDP[i][t]%=;
                }
                MDP[i][]=--t;
            }
        }

    int ans=-,cnt[maxv];
    clr(cnt,);
    rep(i,,n) ans=max(dp(i),ans);
    rep(i,,n) if(ans==dp(i)) {
        int t=max(cnt[],MDP[i][]);
        rep(j,,t+) cnt[j]+=MDP[i][j];
        rep(j,,t+) if(cnt[j]/) {
            cnt[j+]+=cnt[j]/;
            cnt[j]%=;
        }
        while(cnt[++t])
            if(cnt[t]/) {
                cnt[t+]+=cnt[t]/;
                cnt[t]%=;
            }
        cnt[]=--t;
    }
    cout<<ans<<' ';
    for(int i=cnt[];i>;i--) cout<<cnt[i];
    cout<<endl;

    return ;
}

Buy Low, Buy Lower

The advice to "buy low" is half the formula to success in the stock market. But to be considered a great investor you must also follow this problems' advice:

"Buy low, buy lower"

That is, each time you buy a stock, you must purchase more at a lower price than the previous time you bought it. The more times you buy at a lower price than before, the better! Your goal is to see how many times you can continue purchasing at ever lower prices.

You will be given the daily selling prices of a stock over a period of time. You can choose to buy stock on any of the days. Each time you choose to buy, the price must be lower than the previous time you bought stock. Write a program which identifies which days you should buy stock in order to maximize the number of times you buy.

By way of example, suppose on successive days stock is selling like this:

 Day   1  2  3  4  5  6  7  8  9 10 11 12
Price 68 69 54 64 68 64 70 67 78 62 98 87

In the example above, the best investor (by this problem, anyway) can buy at most four times if they purchase at a lower price each time. One four day sequence (there might be others) of acceptable buys is:

Day    2  5  6 10
Price 69 68 64 62

PROGRAM NAME: buylow

INPUT FORMAT

Line 1:	N (1 <= N <= 5000), the number of days for which stock prices are available.
Line 2..etc:	A series of N positive space-separated integers (which may require more than one line of data) that tell the price for that day. The integers will fit into 32 bits quite nicely.

SAMPLE INPUT (file buylow.in)

12
68 69 54 64 68 64 70 67
78 62 98 87

OUTPUT FORMAT

Two integers on a single line:

• the length of the longest sequence of decreasing prices
• the number of sequences that have this length

In counting the number of solutions, two potential solutions are considered the same (and would only count as one solution) if they repeat the same string of decreasing prices, that is, if they "look the same" when the successive prices are compared. Thus, two different sequence of "buy" days could produce the same string of decreasing prices and be counted as only a single solution.

SAMPLE OUTPUT (file buylow.out)

4 2