筷子战神

我直接拿筷子，加水泥加502，把出题人的迪奥***

nijiama • 12天前

雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验雨花数组测验

asdfwww • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

include

using namespace std;

int a[100005];

int main() {

int n;
cin >> n;
for (int i = 0; i < n; i++) {
	cin >> a[i];
}
int max = -1;
int count = 0;
for (int i = 0; i < n; i++) {
	if (max < a[i]) {
		max = a[i];
		count++;
	}

}

cout << count;

}

wwy1 • 12天前

比赛已结束。