Submission #74584994

---

Source Code Expand

#include<bits/stdc++.h>
//#define nm/2^k nm>>k
//#define nm*2^k nm<<k
using namespace std;
bool comp(string a,string b){
if(a.size()!=b.size()){
return a.size()<b.size();
}
return a<b;
}
int gcd(int a, int b) {
while (b != 0) {
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
void SieveOfEratosthenes(int n)
{
vector<bool> prime(n + 1, true);
for (int p = 2; p * p <= n; p++)
{
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
void built(int ind,int l,int r,vector<int>&segment,vector<int>&a){
if(l==r)
{
segment[ind]=a[l];
return;
}
int mid=(l+r)/2;
built(2*ind+1,l,mid,segment,a);
built(2*ind+2,mid+1,r,segment,a);
segment[ind]=min(segment[2*ind+1],segment[2*ind+2]);
}
int query(int ind,int il,int ir,int l,int r,vector<int>&segment,vector<int>&a){
if(il>r || ir<l){
return INT_MAX;
}
if(il<=l && ir>=r){
return segment[ind];
}
int mid=(l+r)/2;
int x=query(2*ind+1,il,ir,l,mid,segment,a);
int y=query(2*ind+2,il,ir,mid+1,r,segment,a);
return min(x,y);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<int>a(n),b;
int max=0;


for(int i=0;i<n;i++)
{
cin>>a[i];
if(max<a[i]){
    max=a[i];
    b.push_back(i+1);


}
}
for(int i=0;i<b.size();i++){
cout<<b[i]<<" ";
}

return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:75:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 | for(int i=0;i<b.size();i++){
      |             ~^~~~~~~~~

Judge Result