树状数组： fzu oj 2236 第十四个目标

#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
#include<vector>


#define ll long long
#define INF 0x3f3f3f3f
#define maxn  100005
#define MOD 1000000007

//链接：http://acm.fzu.edu.cn/problem.php?pid=2236

//本题如果用动态规划会操时o（n^2）

代码是

#include <cstdio>
#include <algorithm>
#define mod 1000000007
using namespace std;
long long num[100010], dp[100010];
int main()
{
	int n;
	
	while ( ~scanf( "%d", &n)){
		for ( int i = 1; i <= n; i++){
			scanf( "%d", &num[i]);
		}
		long long s = 0;
		for(int i = 1;i <= n;i++){
        	dp[i] = 1;
        	for(int j = 1;j < i;++j){
           		if(num[j] < num[i]){
             	   dp[i] += dp[j];
           		}
        	}
    	}
    	for(int i = 1;i <= n;i++){
    		 s += dp[i];
    		 s = s % mod;
    	}
    	printf( "%lld\n", s);
	}
	return 0;
}

#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
#include<vector>

代码是

//链接：http://acm.fzu.edu.cn/problem.php?pid=2236
//本题对树状数组的应用是实现动态规划，树状数组c中保存的是第i小的数出现了几次 
//举例说吧：设输入的数是7 3 4 7 9，首先把给定的数按从小到大排列，然后去重，保存在b数组之中，所以b数组是3 4 7 9，
//然后检索原来的数组（a数组）中的每一个元素（比如7吧），就去b数组中发现他是第3小的，他前面有两个数，遍历树状数去求和，
//就是求出了以3和4这两个元素结尾的字符串的总数，然后更新树状数组，以此类推

#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
#include<vector>

#define ll long long
#define INF 0x3f3f3f3f
#define maxn  100005
#define MOD 1000000007

using namespace std;

int  c[maxn];
int a[maxn];
int b[maxn];
int dp[maxn];

int n;
int cnt;
int Query(int i)
{
    int ans = 0;
    while(i >= 1)
    {
        ans = (ans + c[i]) % MOD;
        i -= i & (-i);
    }
    return ans;
}

void Update(int i, int val)
{
    while(i <= cnt)
    {
        c[i] = (c[i] + val) % MOD;
        i += i&(-i);
    }
}


int main()
{
	while(~scanf("%d",&n)){
		for(int i = 1;i <= n;i++){
			scanf("%d",&a[i]);
			b[i] = a[i];
		}
		sort(b+1,b+1+n);
		memset(c,0,sizeof(c));
		memset(dp,0,sizeof(dp));
		cnt = 1;
		for(int i = 2;i <= n;i++){
			if(b[i] != b[i-1]){
				b[++cnt] = b[i];
			}
		}
		for(int i = 1;i <= n;i++){
			int pos = lower_bound(b+1,b+cnt+1,a[i])- b;
			dp[i] = Query(pos-1)+1%MOD;
			Update(pos,dp[i]);
		}
		cout << Query(cnt) << endl;
	}
	return 0;
}