QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#134929	#6636. Longest Strictly Increasing Sequence	little_brush^#	AC ✓	2ms	3820kb	C++14	1.1kb	2023-08-05 10:05:49	2023-08-05 10:05:51

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-08-05 10:05:51]
评测

测评结果：AC
用时：2ms
内存：3820kb

查看

[2023-08-05 10:05:49]
提交

answer

#include<bits/stdc++.h>
using namespace std;

inline int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0' || c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0' && c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}

int n;
int a[15],ans[15];

int main()
{
	int T=read();
	while(T--)
	{
		n=read();
		for(int i=1;i<=n;i++) a[i]=read();
		bool flag=true;
		for(int i=1;i<=n;i++)
			if(a[i]!=a[i-1] && a[i]!=a[i-1]+1)
			{
				flag=false;
				break;
			}
		if(!flag) 
		{
			printf("NO\n");
			continue;
		}
		for(int i=1;i<=n;i++)
		{
			if(a[i]==a[i-1]+1)
			{
				int maxx=0;
				for(int j=1;j<=i-1;j++) maxx=max(maxx,ans[j]);
				if(maxx+1<=100) ans[i]=maxx+1;
				else 
				{
					for(int j=1;j<=i-1;j++) ans[j]--;
					ans[i]=maxx;
				} 
			}
			else
			{
				int minn=1e9;
				for(int j=1;j<=i-1;j++) minn=min(minn,ans[j]);
				if(minn-1>=1) ans[i]=minn-1;
				else 
				{
					for(int j=1;j<=i-1;j++) ans[j]++;
					ans[i]=minn;
				} 
			}
		}
		printf("YES\n");
		for(int i=1;i<=n;i++) printf("%d ",ans[i]);
		printf("\n");
	}
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3820kb

input:

2
6
1 2 3 2 5 7
2
1 2

output:

NO
YES
1 2

result:

ok t=2 (2 test cases)

Test #2:

score: 0

Accepted

time: 2ms

memory: 3600kb

input:

3483
5
2 3 5 1 1
2
8 1
10
1 2 3 4 4 5 6 6 6 7
10
1 1 2 2 2 2 3 4 4 5
2
5 8
3
7 10 8
5
4 1 3 3 8
10
1 2 2 2 2 2 2 3 3 3
10
1 1 2 3 4 5 5 5 5 6
9
1 2 3 4 5 5 6 6 7
7
8 8 8 8 9 1 2
5
8 9 8 3 5
10
1 2 3 3 3 3 4 4 4 5
5
7 1 6 4 3
7
5 6 8 6 1 5 5
10
1 2 2 3 4 4 4 4 5 5
3
10 4 5
3
1 5 3
5
2 8 1 2 1
3
7 8 3...

output:

NO
NO
YES
4 5 6 7 3 8 9 2 1 10 
YES
6 5 7 4 3 2 8 9 1 10 
NO
NO
NO
YES
8 9 7 6 5 4 3 10 2 1 
YES
5 4 6 7 8 9 3 2 1 10 
YES
3 4 5 6 7 2 8 1 9 
NO
NO
YES
6 7 8 5 4 3 9 2 1 10 
NO
NO
YES
6 7 5 8 9 4 3 2 10 1 
NO
NO
NO
NO
NO
NO
YES
6 5 4 7 3 8 2 9 1 
NO
NO
NO
NO
NO
NO
NO
YES
6 7 8 5 4 9 3 2 10 1 
YES
8 ...

result:

ok t=3483 (3483 test cases)