Educational Codeforces Round 15
题目链接在这里A. Maximum Increase最长上升子串#include <bits/stdc++.h>using namespace std;int n;
int arr[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
int ans = 0;
原创
2016-09-12 21:56:23 ·
367 阅读 ·
0 评论