【 Codeforces Round #816 (Div. 2)-C】【找规律】

 

 

 

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef long long LL;
LL a[N];
LL s[N];
int main()
{
	int n,m;
	cin>>n>>m;
	
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}

    for(int i=2;i<=n;i++)
    {
    	if(a[i]==a[i-1])
    	{
    		s[i]=n-i+1;
		}
	}
	
	
	for(int i=n;i>=1;i--)
	{
		s[i]=s[i+1]+s[i];
	}
	
	LL sum=0;
	for(int i=n;i>=1;i--)
	{
		LL ss=(LL)i*(i+1)/2;
		sum+=ss-(s[n-i+2]-s[n+1]);
    }
    //cout<<"sum is "<<sum<<endl;
    
	while(m--)
	{
		int idx,x;
		cin>>idx>>x;
		int p=idx;
		
		if(a[idx]==a[idx-1])
		{
			int cnt=n-idx+1;
	    	int co=idx-1;
	    	sum=sum+(LL)co*cnt;
		}
		
		
	    if(a[idx]==a[idx+1])
	    {
	    	idx++;
	    	int cnt=n-idx+1;
	    	int co=idx-1;
	    	sum=sum+(LL)co*cnt;
		}
		
		idx=p;
		if(x==a[idx-1])
		{
			int cnt=n-idx+1;
	    	int co=idx-1;
	    	sum=sum-(LL)co*cnt;
		}
		
		if(x==a[idx+1])
		{
			idx++;
			int cnt=n-idx+1;
	    	int co=idx-1;
	    	sum=sum-(LL)co*cnt;
		}
		
		cout<<sum<<endl;
		a[p]=x;
	}
	
	
	return 0; 
}