摘要:
刚开始看到题目,想用memmove偷懒,结果TLE,后来查了查,才发现用memmove也是O(n^2)的复杂度。。。#include <stdio.h>#include <string.h>int seq[222222];int main(){ int n,i,j,idx,posi,vali,t; while (~scanf("%d",&t)) { memset(seq,0,sizeof(seq)); for (i=0;i<t;i++) { scanf("%d%d",&posi,&vali); ... 阅读全文