Codeforce E. Lucky Queries 线段树实践(二)
r = (char *) malloc(sizeof(char) * (n+1)); gets(str); conTree(); char command[8]; for (int i = 0; i < m; i++) { char c = getchar(); if ('c' == c) { printf("%d\n", getLongestIncease()); gets(command);//gets一行 } else { while (c != ' ') c = getchar(); int low, up; scanf("%d %d", &low, &up); updateTree(low-1, up-1, 0, n-1); if (i+1 != m) getchar(); } } } ~LuckyQueries() { if (str) free(str); if (segTree) free(segTree); } };