CF1043D

這道題也不能說是dp，感覺dp沒那麼強。

題目是說，給定m（m<=10）個數列，每個數列包含n個數（n<=1e5).問這m個數列中有多少個相同的子數列（連續的哦）

重點在於透過第一個數列，即以第一個數列為樣本，找到符合條件的子數列。從第一個數列的最後開始向前遍歷，每次判斷m條數列是不是都滿足第i個位子的數字x的後面是數字y。如果不是，這個位置dp值記為1，否則就是dp【i+1】+1。答案加上每個位子的dp值即可。

//#pragma GCC optimize(3)
//#pragma comment(linker, "/STACK:102400000,102400000")  
 
//c++
// #pragma GCC diagnostic error "-std=c++11"
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <algorithm>
#include  <iterator>
#include  <iostream>
#include   <cstring>
#include   <cstdlib>
#include   
 
<iomanip>
#include    <bitset>
#include    <cctype>
#include    <cstdio>
#include    <string>
#include    <vector>
#include     <stack>
#include     <cmath>
#include     <queue>
#include      <list>
#include       <map>
#include       
 
<set>
#include   <cassert>

using namespace std;
#define lson (l , mid , rt << 1)
#define rson (mid + 1 , r , rt << 1 | 1)
#define debug(x) cerr << #x << " = " << x << "\n";
#define pb push_back
#define pq priority_queue



typedef long long ll;
typedef unsigned long long ull;
//typedef __int128 bll;
typedef pair<ll ,ll > pll;
typedef pair<int ,int > pii;
typedef pair<int,pii> p3;

//priority_queue<int> q;//這是一個大根堆q
//priority_queue<int,vector<int>,greater<int> >q;//這是一個小根堆q
#define fi first
#define se second
//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)
#define FT(A,B,C) for(int A=B;A <= C;++A)  //用來壓行
#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)
#define max3(a,b,c) max(max(a,b), c);
//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFF;  //2147483647
const ll nmos = 0x80000000;  //-2147483648
const int inf = 0x7f7f7f7f;
const ll inff = 0x3f3f3f3f3f3f3f3f; //18
const int mod = 1e8+7;
const double esp = 1e-8;
const double PI=acos(-1.0);
const double PHI=0.61803399;    //黃金分割點
const double tPHI=0.38196601;


template<typename T>
inline T read(T&x){
    x=0;int f=0;char ch=getchar();
    while (ch<'0'||ch>'9') f|=(ch=='-'),ch=getchar();
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x=f?-x:x;
}


/*-----------------------showtime----------------------*/
            const int maxn = 1e5+9;
            ll mp[20][maxn],a[20][maxn],dp[maxn];
int main(){
            int n,m;
            scanf("%d%d", &n, &m);
            for(int i=1; i<=m; i++){
                for(int j=1; j<=n; j++){
                    scanf("%lld", &mp[i][j]);
                    a[i][mp[i][j]] = j;
                }
            }   
            ll ans = 0;
            for(int i=n; i>=1; i--){
                int flag = 1, val = mp[1][i];
                dp[a[1][val]] = 1;
                for(int j=2; j<=m; j++){
                    if(a[j][val]+1>n || a[1][val]+1>n || mp[j][a[j][val]+1] != mp[1][a[1][val]+1]){
                        flag = 0;
                    }
                }
                if(flag)dp[i] = dp[i+1] + 1;
                ans += dp[i];
            }
            printf("%lld\n", ans);
            return 0;
}