Loops - Longest 3

Week2
int prev; int curr; int len=0;
int maxlen = 0;
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1;
scanf(“%d”,&curr);
while(curr != -1) {
if(prev < curr) {
len = len + 1;
}else{
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 0 0
if(prev < curr) {
len = len + 1;
}else{
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 0 0
if(prev < curr) {
len = len + 1;
}else{
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 0 0
if(prev < curr) {
len = len + 1;
}else{
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 0 0
if(prev < curr) {
len = len + 1;
}else{ 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len;
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5 -1
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5 -1
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5 -1
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5 -1
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2 3
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5 -1
if(maxlen < len){
maxlen = len;
}
}}
int prev; int curr; int len=0;
int maxlen = 0; 3 2 1 3 5 -1
scanf(“%d”,&prev);
if(prev != -1) {
len = 1; maxlen =1; prev curr len maxlen
scanf(“%d”,&curr);
while(curr != -1) { 3 2 0 0
if(prev < curr) {
len = len + 1;
}else{ 2 1 1 1
if(maxlen < len){
/* longer subseq. found*/
maxlen = len; 1 3 2 3
}
len = 1;
}
prev = curr;
3 5 3
scanf(“%d”,&curr);
}
/*when the last subseq is longest*/ 5 -1
if(maxlen < len){
maxlen = len;
}
}}
Acknowledgments: This lecture slide is based on the material prepared by Prof.
Sumit Ganguly, CSE, IIT Kanpur. The slide design is based on a template by Prof.
Krithika Venkataramani.

“The instructor of this course owns the copyright of all the course materials. This lecture material
was distributed only to the students attending the course ESC-101 of IIT Kanpur, and should not
be distributed in print or through electronic media without the consent of the instructor. Students
can make their own copies of the course materials for their use.”