QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#594133#9313. Make MaxliyutengWA 102ms6380kbC++14932b2024-09-27 19:35:452024-09-27 19:35:46

Judging History

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

  • [2024-09-27 19:35:46]
  • 评测
  • 测评结果:WA
  • 用时:102ms
  • 内存:6380kb
  • [2024-09-27 19:35:45]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[200001];
int b[200001];
int cnt=0;
signed main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
		}
		int sum=0;
		int lon=0;
		int mmax=0;
		int mmin=1e9;
		for(int i=1;i<=n;i++){
			mmin=1e9;
			cnt=0;
			if(i==1){
				mmax=a[i];
				lon++;
			}else{
				if(a[i]==mmax){
					lon++;
				}else{
					if(a[i]<mmax){
						int p=i;
						while(a[p+1]<=a[p]&&p+1<=n){
							p++;
						}
						for(int j=i-1;j<=p;j++){
							if(a[j]<mmin){
								mmin=a[j];
								cnt++;
								b[cnt]++;
							}else if(a[j]==mmin){
								b[cnt]++;
							}
						}
						i=p;
						for(int j=cnt;j>=1;j--){
							sum+=b[j]*(j-1);
						}
						lon++;
					}else{
						mmax=a[i];
						sum+=lon;
						lon++;
					}
				}
			}
		}
		cout<<sum<<endl;
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3616kb

input:

4
2
1 2
2
2 2
7
1 1 1 2 2 2 2
3
1 2 3

output:

1
0
3
3

result:

ok 4 number(s): "1 0 3 3"

Test #2:

score: -100
Wrong Answer
time: 102ms
memory: 6380kb

input:

2
198018
875421126 585870339 471894633 383529988 625397685 944061047 704695631 105113224 459022561 760848605 980735314 847376362 980571959 329939331 644635272 326439858 752879510 837384394 175179068 182094523 397239381 1199016 185143405 279638454 252374970 822030887 860312140 137248166 993229443 164...

output:

1048250457
2998720302

result:

wrong answer 1st numbers differ - expected: '4084978', found: '1048250457'