UVA 12385 Interesting Sequences

I - Interesting Sequences

For a sequence of integer numbers <x₁,x₂,…,x_n>, a contiguous subsequence <x_i,x_i+1,…,x_j> where i<j≤n, is called "interesting" if  its first and last elements are equal (i.e., x_i=x_j). Two interesting subsequences S₁=<x_i,x_i+1,…,x_j> and S₂=<x_a,x_a+1,…,x_b> are called conflict-free if either a≥j or i≥b.

For a given sequence of known size, find the maximum number of interesting subsequences which are pairwise conflict-free. 

Input

The first line of input contains an integer T≤100 denoting the number of test-cases. Each test-case begins with an integer 1≤N≤100,000, on a separate line, denoting the size of the sequence. The following line contains N positive integers each between 1 and 100,000 (inclusive).

Output

For each test-case, output on a single line the maximum number of pairwise conflict-free interesting subsequences.

Sample Input	Sample Output
3 6 1 2 1 3 1 2 4 2 4 2 4 9 10 2 2 10 3 4 5 4 3	2 1 2

  解析

这个题的题意略坑，其实是问怎么划分这个数列使有趣数列的总数最大。

样例解释

1 2 1 3 1 2

2 4 2 4

10 2 2 10 3 4 5 4 3 

动态规划 f[i]表示前i个数最大的总数，显而易见只有存在以i结尾的有趣数列才f[i]可能改变。
顺带提一点，要记录pre

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

using namespace std;

int Pre[100010],Pot[100010],N,Arr[100010],f[100010];

void readdata()
{
	memset(Pre,0,sizeof(Pre));
	memset(Pot,0,sizeof(Pot));
	memset(f,0,sizeof(f));

	scanf("%d",&N);
	for(int i=1;i<=N;i++)
	{
		scanf("%d",&Arr[i]);
		Pre[i]=Pot[Arr[i]];
		Pot[Arr[i]]=i;
	}	
}
void work2()
{
	for(int i=1;i<=N;i++)
	{
		f[i]=f[i-1];
		if(Pre[i]!=0) f[i]=max(f[i],f[Pre[i]]+1);
	}

	printf("%d",f[N]);
}

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

	int T;
	scanf("%d",&T);
	for(int i=1;i<=T;i++)
	{
		readdata();
		work2();
		printf("\n");
	}

	return 0;
}