BestCoder Round #16 1001 Revenge of Segment Tree 1002 Revenge of LIS II

最新推荐文章于 2017-08-22 15:02:53 发布

zyjhtutu

最新推荐文章于 2017-08-22 15:02:53 发布

阅读量330

点赞数

分类专栏： BestCoder 文章标签： BestCoder acm algorithm

本文链接：https://blog.csdn.net/zyjhtutu/article/details/40686681

版权

BestCoder 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

1001	Revenge of Segment Tree

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll __int64
#define MOD 1000000007
#define MAX 1000000

using namespace std;

ll a[MAX];

int main(){
	int T,n;
	scanf("%d",&T);
	while (T--){
		scanf("%d",&n);
		ll sum = 0;
		for (int i = 0; i<n; i++) scanf("%I64d",&a[i]);
		for (int i = 0; i<n; i++)
			sum = (sum + a[i]*(i+1)%MOD*(n-i)%MOD) % MOD;
		printf("%I64d\n",sum);	
	}
	return 0;
}

1002	Revenge of LIS II

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll __int64
#define MAX 1010

using namespace std;

ll dp[MAX],cnt[MAX];
int a[MAX];

int main(){
	int T,n;
	scanf("%d",&T);
	while (T--){
		scanf("%d",&n);
		for (int i = 0; i<n; i++) scanf("%d",&a[i]);
		for (int i = 0; i<n; i++){
			dp[i] = 1;
			cnt[i] = 1;
		}
		for (int i = 1; i<n; i++)
			for (int j = i-1; j>=0; j--){
				if (a[i] > a[j]){
					if (dp[i] < dp[j] + 1){
						cnt[i] = cnt[j];
						dp[i] = dp[j] + 1;
					}
					else if (dp[i] == dp[j] + 1){
						cnt[i] += cnt[j];
					}
				}
			}
		ll ans = 0,res = 0;
		for (int i = 0; i<n; i++)
			if (ans < dp[i]){
				ans = dp[i];
				res = cnt[i];
			}
			else if (ans == dp[i]){
				res += cnt[i];
			}
		if (res > 1) printf("%I64d\n",ans);
		else printf("%I64d\n",ans-1);
	}
	return 0;
}