【codeforces】CF11A Increasing Sequence （题解）CF11A Increasing Sequence
CF11A Increasing Sequence入门题，就不解释了题解：算法复杂度为O(n)#include <iostream>#include <algorithm>using namespace std;int a[2001];int main(){ int n,b,ans; cin>>n>>b;...
