SRM 498 div2

int getMaximumPoints(int A, int B, int C, int N)
        {
            int i,j,k;
			int sum = 0;
			int num[3] = {A,B,C};
			for(int i = 1;i = 1)
			  num[2]--;
			}
			return sum;
        }

string isValid(vector <int> seq)
        {
            int i,j,k;
			string ss;
			int flag = true;
			int len = seq.size();
			if(len = len)
				  break;
			  while(seq[i+1] - seq[i] == x && x > 0){
			     i++;
			  }
			  a = i;
			  x = seq[i+1] - seq[i];
			  while(seq[i+1] - seq[i] == x && x  0){
			    i++;
			  }
			  d = i;
			  x = seq[i+1] - seq[i];
			  while(seq[i+1] - seq[i] == x && x <br>
<br>



</int>