TOAN DEP TRAI

include <iostream>

using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[n];
for (int i=0;i<n;i++){ cin>>a[i];
}
int l=0;r=n-1;
while (l<r){
if (a[l]+a[r]==m){
cout<<l<<" "<<r; return 0; } else if (a[l]+a[r]>m){
r--;
}
else {l++;}
}
cout<<"No solution";
return 0;
}

tt

include <bits/stdc++.h>

using namespace std;
int n,f[1000001],a[1000001],ans=1;
int main()
{
cin>>n;
for (int i=1;i<=n;i++){
cin>>a[i];
f[i]=1;
for (int j=1;j<=i-1;j++)
if (a[j]<a[i]) f[i]=max(f[i],f[j]+1);
ans=max(ans,f[i]);
}
cout<<ans;
}

Condemned to darkness, where our power grows.

uoc