Tags » LIS

The Complexity of Information

As we enter an age with more and more technological advancement, we find that information once simple to find has grown and amassed itself into a field large enough to fill its own database. 212 more words

The Struggle Is Real: Surviving MLIS; A Personal Documentation

UVa 481 - What Goes Up

Used Algorithm LIS nlogk.


/*
user: turing_13
link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=422
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 100100
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,a) for(int i=0;i<a;i++)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;
int print,L;
int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    vector<int>v;
    v.pb(1000000);
    int num;
    while(cin>>num)
        v.pb(num);

    int sz=SZ(v);
    for(int i=1; i<sz; i++)
        print[i]=100000000;
    print[0]=-100000000;

    int ans=1;
    int length=0;
    for(int i=1; i<sz; i++)
    {
        int left=0,right=length;
        while(left<=right)
        {
            int mid=(left+right)/2;
            if(print<v[i])
                left=mid+1;
            else
                right=mid-1;
        }
        print=v[i];
        if(left>length)
            length++;
        L[i]=left;
        ans=max(ans,L[i]);
    }

    int i;
    for(i=sz-1; i>0; i--)
        if(L[i]==ans)
            break;

    int ara;
    int top=v[i],indx=ans;
    ara[--indx]=v[i];

    for(--i; i>0; i--)
        if(v[i]<top && L[i]==indx)
        {
            top=v[i];
            ara[--indx]=v[i];
        }

    cout<<ans<<endl<<'-'<<endl;
    for(i=0; i<ans; i++)
        cout<<ara[i]<<endl;
        
    return 0;
}

UVa

UVa 231 - Testing the CATCHER


/*
user: turing_13
link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=167
*/
#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 100100
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,a) for(int i=0;i<a;i++)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;
int L;
int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    int n;
    vector<int>v;
    int z=0;
    while(cin>>n && n!=-1)
    {
        if(z)
            cout<<endl;
        v.pb(100000);
        v.pb(n);
        int num;
        while(cin>>num &&num!=-1)
            v.pb(num);
        int sz=SZ(v);
        for(int i=0;i<=sz;i++)
            L[i]=1;
        int ans=1;
        for(int i=1;i<sz;i++)
        {
            for(int j=i+1;j<sz;j++)
                if(v[j]<v[i] && L[i]+1 > L[j])
                    ans=max(ans,++L[j]);
        }
        pf("Test #%d:\n",++z);
        cout<<"  maximum possible interceptions: "<<ans<<endl;
        v.clear();
    }
    return 0;
}

UVa

Summary of "Playful or Gameful? Creating Delightful UX"

I’ve kicked off the term in the usual way, which is to say I signed up for an early presentation slot for my UX research course. 168 more words

Courses

The Case of Joe Murphy, Librarian

Some quotations related to the case of Joe Murphy, Librarian:

From librarian Meredith Farkas:

It’s been no secret among many women (and some men) who attend and speak at conferences like Internet Librarian and Computers in Libraries that Joe Murphy has a reputation for using these conferences as his own personal meat markets.

597 more words
LIS