x が含まれる場所を判定
find(a + l, a + r, x) (配列)
find(a.begin(), a.end(), x) (vector)
(xが含まれる: a[i]の itr) ( 複数ある場合は最初の値 )
(xが含まれない: a+r または a.endの itr)
<初めて現れる位置>
find(a + l, a + r, x) - a
int f = find(a + l, a + r + 1, x) - a;
More than 1 year has passed since last update.
Register as a new user and use Qiita more conveniently
- You get articles that match your needs
- You can efficiently read back useful information
- You can use dark theme