0
已解决
第一期 难度1, 奖励10
#include<iostream>
#include<cmath>
#include<algorithm>
#include<functional>
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
int n, a[10000005], f[10000005], k, b[20000005];
int ans = 0;
bool flag;
int main() {
cin >> n >> k;
for(int i = 1; i <= n; i ++) {
cin >> a[i];
if(a[i]>a[j]){
f[i] = max(f[i], f[b[a[i]]]);
if(ans < f[i])
ans = f[i];
b[a[i]] = i;
}
cout << ans;
return 0;
}
//错误提示信息:
1.memory
2.ISO
2.expect
//错误2处
//注 错误指语法错误,与题目无关
李致远在2021-08-10 11:50:28追加了内容
//三处错误
0
0
0
0
0
0
0
