#include<iostream> using namespace std; int main(){ int n; cin >>n; int Max = -101; for(int i;i<=n;i++){ int x; cin >>x; if(x>Max)Max = x; } cout<<Max; return 0; }

原来可以用sort...

#include<bits/stdc++.h> #include<vector> using namespace std; vector<int>a; int main(){ }

#include<bits/stdc++.h> using namespace std; const int N=100001; int n; int main() { vector<int>a; cin>>n; for(int i=1;i<=n;++i) { int t; cin>>t; a.push_back(t); } int maxx=-N; vector<int>::iterator k; for(k=a.begin();k!=a.end();++k) { if(*k>maxx) maxx=*k; } cout<<maxx; return 0; }

#include<bits/stdc++.h> using namespace std; const int N=100001; int n; int main(){ vector<int>a; cin>>n; for(int i=1;i<=n;i++){ int t; cin>>t; a.push_back(t); } int maxx=-N; vector<int>::iterator k; for(k=a.begin();k!=a.end();++k){ if(*k>maxx) maxx=*k; } return 0; }

#include<bits/stdc++.h> using namespace std; int n; int main() { vector<int>a; cin>>n; for(int i=1;i<=n;i++) { int t; cin>>t; a.push_back(t); } int maxx=-999999999; vector<int>::iterator k; for(k=a.begin();k!=a.end();++k) { if(*k>maxx) maxx=*k; } cout<<maxx; return 0; }

#include <bits/stdc++.h> using namespace std; int a,b[105]; int c=-110; int main(){ cin>>a; for(int i=0;i<=a-1;i++){ cin>>b[i]; c=max(c,b[i]); } cout<<c; }