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

#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;
}

#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;
}