QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#569799#9313. Make MaxjxxiaoyuWA 101ms6764kbC++14942b2024-09-17 10:58:542024-09-17 10:58:54

Judging History

This is the latest submission verdict.

  • [2024-09-18 15:56:24]
  • hack成功,自动添加数据
  • (/hack/836)
  • [2024-09-17 10:58:54]
  • Judged
  • Verdict: WA
  • Time: 101ms
  • Memory: 6764kb
  • [2024-09-17 10:58:54]
  • Submitted

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;
//int x[9]={0,1,0,1,-1,0,-1,1,-1}; 
//int y[9]={0,0,1,1,0,-1,-1,-1,1};
void solve(){
	int n;
	cin>>n;
	int shuzi[200005]={0},num[200005]={0},nut=1;
	cin>>shuzi[nut];
	num[nut]++;
	int ans=0;
	for(int i=1;i<n;i++){
		int a;
		cin>>a;
		if(a>shuzi[nut]){
			ans+=num[nut];
			if(shuzi[nut-1]==0){
				shuzi[nut]=a;
				num[nut]++;
				continue;
			}
			if(shuzi[nut-1]>a){
				shuzi[nut]=a;
				num[nut]++;
			}else if(shuzi[nut-1]<a){
				num[nut-1]+=num[nut];
				shuzi[nut]=a;
			}else{
				num[nut-1]+=(num[nut]+1);
				nut--;
			}
		}
		else if(a<shuzi[nut]){
			nut++;
			shuzi[nut]=a;
			num[nut]++;
		}else{
			num[nut]++;
		}
	}
	int sum=0;
	for(int i=2;i<=nut;i++){
		ans+=(sum+num[nut]);
		sum+=num[nut];
	} 
	cout<<ans<<endl;
	
}
signed main() {
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}

	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 6764kb

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: 101ms
memory: 6752kb

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:

4889397117
4546362463

result:

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