TJU 2199. A+B Problem November 29, 2009

TJU 2199. A+B Problem
<em>–TLE–

----its giving TLE----
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define FOR(x,y,z) for(x=y;x<=z;x++)
int main()
{
  int n,a[1002],b[1002];
  int i,j,k,l,max,tmp,flag;

  while(1)
  {
    scanf("%d",&n);
    if(n==0) break;
    for(i=1;i<=n;i++)
     scanf("%d",&a[i]);

    max=-1;
    FOR(i,1,n)
    {
      flag=0;
      FOR(j,1,n)
      {
        FOR(k,1,n)
        {
         if(i!=j&&i!=k&&j!=k&&a[i]==(a[j]+a[k]))
             {tmp=a[i];flag=1;goto down;}
         }
        }
       down:
       if(tmp>max&&flag==1)
        max=tmp;
      }
    
        printf("%d\n",max);
   }

return 0;
}

TJU 3120. Stock Exchange November 13, 2009

TJU 3120. Stock Exchange

TLE

//its giving TLE for the last large input
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define FOR(x,y,z) for(x=y;x<z;x++)
#define IF(w,z) if(w>z)
#define IF2(w1,z1,w2,z2) if( w1>z1&&w2>z2)
#define SCANF(e) scanf("%lld",&e)
int main()
{
  long long int n,a[100000],len[100000],max;
  int i,j,k;
  
  while(SCANF(n)!=EOF){   
   FOR(i,0,n)
       SCANF(a[i]);
     
   len[0]=1;
   
   FOR(i,1,n)
   {
     len[i]=1;
     FOR(j,0,i)
      {
        IF2(a[i],a[j],len[j]+1,len[i])
        len[i]=len[j]+1;
      }
   }
   
   max=0;
   FOR(i,0,n) 
     IF(len[i],max)
       max=len[i];

     printf("%lld\n",max);
     
    }

return 0;
}