过不了样例,求助unique

P4305 [JLOI2011] 不重复数字

@[WsW_](/user/349824) ```cpp #define _CRT_SECURE_NO_WARNINGS 1 #include<cstdio> #include<iostream> #include<algorithm> using namespace std; struct node { int id, s; bool operator==(const node& p) { return s == p.s; } }a[50005]; int T, n; bool cmp1(node u, node v) { if (u.s != v.s)return u.s < v.s; else return u.id < v.id; } bool cmp2(node u, node v) { return u.id < v.id; } int main() { scanf("%d", &T); while (T--) { scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &a[i].s); a[i].id = i; } sort(a + 1, a + n + 1, cmp1); // for(int i=1;i<=n;i++)printf("%d ",a[i].s); // putchar('\n'); n = unique(a + 1, a + n + 1) - (a+1);//这 // for(int i=1;i<=n;i++)printf("%d ",a[i].s); // putchar('\n'); sort(a + 1, a + 1 + n, cmp2); for (int i = 1; i <= n; i++) printf("%d ", a[i].s); putchar('\n'); } return 0; } ``` -(a+1)不是-a
by six_小6猪 @ 2023-07-16 12:36:27


@[six_小6猪](/user/191993) thx
by WsW_ @ 2023-07-16 15:10:52


|