很容易观察到其实就是在找斜率的最长上升序列,分块之后直接处理斜率,怕有精度误差所以用的乘法做判断小于关系,加了一点小优化卡过去了
直接用double表示斜率貌似也可过
/**************************************************************
Problem: 2957
User: wsa
Language: C++
Result: Accepted
Time:10640 ms
Memory:4992 kb
****************************************************************/
#include<cstring>
#include<string>
#include<iostream>
#include<queue>
#include<cstdio>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<vector>
//#pragma comment(linker, "/STACK:1024000000,1024000000");
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 100005
int n,m;
int block,num,belong[maxn],l[maxn],r[maxn],a[maxn],len[maxn];
int now[maxn];
struct node
{
long long x,y;
node()
{
x=y=0;
}
node(long long a,long long b)
{
x=a;
y=b;
}
friend bool operator < (node A,node B)
{
return A.y*B.x<B.y*A.x;
}
}mxx[350];
vector<node>b[350];
void init()
{
block=sqrt(n);
num=n/block;
if(n%block) num++;
for(int i=1; i<=n; i++)
{
a[i]=0;
belong[i]=(i-1)/block+1;
}
for(int i=1; i<=num; i++)
{
len[i]=0;
now[i]=0;
l[i]=(i-1)*block+1;
r[i]=i*block;
}
r[num]=n;
}
void solve(int x,int y)
{
a[x]=y;
int index=belong[x];
b[index].clear();
for(int i=l[index]; i<=r[index]; i++)
{
if(!b[index].size()) b[index].push_back(node(i,a[i]));
else if(b[index][b[index].size()-1]<node(i,a[i])) b[index].push_back(node(i,a[i]));
}
int ans=now[index-1];
node mx=node(1,0);
if(ans) mx=mxx[index-1];
for(int i=index; i<=num; i++)
{
mxx[i]=mx;
now[i]=ans;
if(!b[i].size()||b[i][b[i].size()-1]<mx) continue;
int pos=upper_bound(b[i].begin(),b[i].end(),mx)-b[i].begin();
ans+=b[i].size()-pos;
mx=b[i][b[i].size()-1];
now[i]=ans;
mxx[i]=mx;
}
printf("%d\n",ans);
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
init();
while(m--)
{
int x,y;
scanf("%d%d",&x,&y);
solve(x,y);
}
for(int i=1;i<=num;i++) b[i].clear();
}
return 0;
}