QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #841057 | #9917. The Story of Emperor Bie | NKheyuxiang | WA | 1ms | 5896kb | C++14 | 369b | 2025-01-03 11:50:42 | 2025-01-03 11:50:42 |
Judging History
answer
#include<bits/stdc++.h>
#define N 500005
using namespace std;
int a[N],b[N];
int main(){
int t,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
int mx=0,c=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),mx=max(mx,a[i]);
for(int i=1;i<=n;i++) if(mx==a[i]) b[++c]=i;
printf("%d\n",c);
for(int i=1;i<=n;i++) printf("%d ",b[i]);
printf("\n");
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 5896kb
input:
3 1 5 2 1 3 3 3 3 3
output:
1 1 1 2 0 3 1 2 3
result:
wrong answer 2nd numbers differ - expected: '2', found: '1'